S = input()
N = len(S) - 1

ans = 0


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


for bit in range(1 << N):
    tot = 0
    tmp = S[0]
    for i in range(N):
        if bit >> i & 1:
            tot += int(tmp)
            tmp = S[i + 1]
        else:
            tmp += S[i + 1]
    tot += int(tmp)
    if is_prime(tot):
        ans += 1

print(ans)