from sys import stdin


def is_prime(n):
    if n == 2:
        return True
    if n == 1 or not n % 2:
        return False
    m = int(n ** 0.5) + 1
    for i in range(3, m, 2):
        if not n % i:
            return False
    return True


def main():
    input = lambda: stdin.readline()[:-1]
    S = input()

    n = len(S) - 1
    ans = 0
    for mask in range(1 << n):
        i, num = 0, 0
        for j in range(n):
            if mask & 1 << j:
                num += int(S[i : j + 1])
                i = j + 1
        num += int(S[i:])
        ans += is_prime(num)
    print(ans)


main()