#Completed oon 9/13/2021 14:29
import math
def isPrime(n):
    if n < 2: return False
    for x in range(2,int(math.sqrt(n)+1)):
        if n%x == 0: return False
    return True
def nextPrime(n):
    n+=1
    while isPrime(n) == False:
        n+=1
    return n
def truncatable(n):
    n = str(n)
    for x in range(0,len(n)):
        m = ""
        for y in range(0,len(n)-x):
            m += n[y]
        if isPrime(int(m)) == False: return False
    #repeat but left to right
    for x in range(0,len(n)):
        m = ""
        for y in range(x,len(n)):
            m += n[y]
        if isPrime(int(m)) == False: return False
    return True
sum,count,x = 0,0,nextPrime(7)
while count < 11:
    if truncatable(x) == True:
        sum += x
        count += 1
    x = nextPrime(x)
print("Answer is:", sum)