import math
from itertools import product
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=input()
cnt=0
for bit in product(range(2),repeat=len(s)-1):
    tmp=0
    now=int(s[0])
    for i in range(len(s)-1):
        if bit[i]==0:
            now=now*10+int(s[i+1])
        else:
            tmp+=now
            now=int(s[i+1])
    tmp+=now
    if isprime(tmp):
        cnt+=1
print(cnt)