def is_prime(x):
    if x <= 1:
        return False
    i = 2
    while i * i <= x:
        if x % i == 0:
            return False
        i += 1
    return True

s = list(map(int, input()))
n = len(s)
ans = 0
for b in range(1 << n - 1):
    x = 0
    tmp = s[0]
    for i in range(n - 1):
        if b >> i & 1:
            x += tmp
            tmp = 0
        else:
            tmp *= 10
        tmp += s[i + 1]
    x += tmp
    ans += is_prime(x)

print(ans)