S = input()


#引数nが素数かどうかを判定
def is_prime(n):
    for i in range(2, n + 1):
        if i * i > n:
            break
        if n % i == 0:
            return False
    return n != 1


cnt = 0
for i in range(2 ** (len(S)-1)):
    v = 0
    temp = int(S[0])
    for j in range(len(S)-1):
        if ((i >> j) & 1):
            v+=temp
            temp = int(S[j+1])
        else:
            temp = temp*10+int(S[j+1])
    v+=temp
    if is_prime(v):
        cnt+=1
print(cnt)