N=int(raw_input(""))
def Prime(x):
    for y in range(2,int(x**0.5)+1):
        if x%y==0:
            return 0
    else:
        return 1
def F(x):
    for i in range(0,len(str(x))-1):
        if str(x)[i]>=str(x)[i+1]:
            return 1
    return 0
#print Prime(9)
from itertools import permutations
k=0
for number in range(2,N+1):
    if Prime(number):
        if F(number)==0:
            perms=[''.join(p) for p in permutations(str(number))]
            perms=[int(q) for q in perms]
            x=0
            for i in range(len(perms)):
                if Prime(perms[i])==1:
                    x=x+1
            if x==len(perms):
                for j in range(len(perms)):
                    k=k+perms[j]
                #put the loop to add all the numbers to K here

print k