#include<stdio.h>
int prime(long long int n)
{
	if (n < 2)
		return 0;
	long long int i;
	for (i = 2; i * i <= n; i++)
		if (n % i == 0)
			return 0;
	return 1;
}
int main()
{
	char s[16];
	scanf("%s", s);
	int ans = 0, i, j, max, n, ii;
	for (n = 0; s[n] != '\0'; n++);
	long long int v, k;
	max = 1;
	for (i = 0; i < n; i++)
		max *= 2;
	for (i = 0; i < max; i += 2)
	{
		for (v = k = 0, j = 0, ii = i; j < n; j++, ii /= 2)
		{
			if (ii % 2 > 0)
			{
				v += k;
				k = 0;
			}
			k = 10 * k + s[j] - '0';
		}
		v += k;
		ans += prime(v);
	}
	printf("%d\n", ans);
	return 0;
}