PYTHON

def sieve(n):
    isprime=[True]*(n+1)
    prime=[]
    for i in range(2,n+1):
        if isprime[i]:
            prime.append(i)
        for p in prime:
            if p*i>n:
                break
            isprime[p*i]=False
            if i%p==0:
                break
    return prime
def ac(n:int):
    lst=list(map(int,str(n)))
    return sum(lst)
a=int(input())
Sum=0
for i in sieve(a):
    Sum+=ac(i)
print(Sum%1093)