#include <cmath>
#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
bool isprime(long long x) {
	if (x <= 1) return false;
	for (int i = 2; 1LL * i * i <= x; ++i) {
		if (x % i == 0) {
			return false;
		}
	}
	return true;
}
int main() {
	string s;
	cin >> s;
	int n = s.size();
	int ans = 0;
	for (int i = 0; i < 1 << (n - 1); ++i) {
		long long sum = 0;
		int pre = 0;
		for (int j = 1; j <= n; ++j) {
			if (j == n || ((i >> (j - 1)) & 1)) {
				sum += stoll(s.substr(pre, j - pre));
				pre = j;
			}
		}
		if (isprime(sum)) {
			++ans;
		}
	}
	cout << ans << endl;
	return 0;
}