import math

def isprime(n):
    if n < 2:
        return False
    if n == 2:
        return True
    if n % 2 == 0:
        return False
    for i in range(3, int(math.sqrt(n)) + 1, 2):
        if n % i == 0: return False
    return True

S = list(map(int,list(input())))
N = len(S)
cnt = 0
for w in range(1 << (N-1)):
    tmp1 = int(S[0])
    tmp2 = 0
    for i in range(N-1):
        if w & 1:
            tmp2 += tmp1
            tmp1 = S[i + 1]
        else:
            tmp1 *= 10
            tmp1 += S[i + 1]
        w >>= 1
    tmp2 += tmp1
    if isprime(tmp2):
        cnt += 1
print(cnt)