import math

def is_prime(n):
    if n == 1:
        return False

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

    return True

s = list(str(input()))
n = len(s)
ans = 0
for i in range(1<<(n-1)):
    t = []
    for j in range(n-1):
        if (i>>j)&1:
            t.append('+')
        else:
            t.append('')
    x = []
    for j in range(n-1):
        x.append(s[j])
        x.append(t[j])
    x.append(s[-1])
    x = ''.join(x)
    x = eval(x)
    if is_prime(x):
        ans += 1
print(ans)