def is_prime(i):
    if i <= 1:
        return False
    for j in range(2, int(i**0.5) + 1):
        if i % j == 0:
            return False
    return True

S = list(map(int,input().strip()))
num = len(S)

ans = 0
for mask in range(1 << (num-1)):
    tmp = 0
    cur = 0
    for bit in range(num):
        cur += S[bit]
        if mask >> bit & 1 == 1 or bit == num-1:
            tmp += cur
            cur = 0
        else:
            cur *= 10

    if is_prime(tmp):
        ans += 1

print(ans)