S = input()
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a
N = len(S)
ans = 0
for i in range(2**(N-1)):
    cnd = []
    for j in range(N-1):
        if (i>>j)&1:
            cnd.append(j)
    if len(cnd) == 0:
        tmp = int(S)
    else:
        tmp = int(S[:cnd[0]+1])
        n = len(cnd)
        now = cnd[0]+1
        for i in range(1,n):
            tmp += int(S[now:cnd[i]+1])
            now = cnd[i]+1
        tmp += int(S[cnd[-1]+1:])
    if len(prime_factorize(tmp)) == 1:
        ans += 1
print(ans)