# https://[Log in to view URL]

def is_prime(n):
    for d in range(2, int(n**0.5) + 1):
        if n % d == 0:
            return 0
    return 1 if n > 1 else 0

def f(n):
    if n < 10:
        return 0
    s = str(n)
    if len(s) % 2 == 0:
        t = s
    else:
        t = s[-1] + s[:-2]
    a, b = int(t[: len(t)//2]), int(t[len(t)//2:])
    r = is_prime(a) + is_prime(b)
    return r

def solve(n):
    return sum(f(k) for k in range(1, n + 1))

for k in range(10, 200):
    # print("k =", k, "->", f(k))
    print(f(k))