def is_prime(x: int) -> bool:
	if x < 2: return False
	if x == 2 or x == 3 or x == 5: return True
	if x % 2 == 0 or x % 3 == 0 or x % 5 == 0: return False

	prime_number = 7
	difference = 4

	while prime_number ** 2 <= x:
		if x % prime_number == 0: return False

		prime_number += difference
		difference = 6 - difference

	return True

s = input()
n = len(s)
ans = 0
for b in range(1 << (n - 1)):
	now = s[0]
	cnt = 0
	for i in range(1, n):
		if b >> (i - 1) & 1:
			cnt += int(now)
			now = s[i]
		else:
			now += s[i]
	cnt += int(now)
	if is_prime(cnt):
		ans += 1
print(ans)