#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;

bool isPrime(lint n) {
	if (n < 2) return false;
	if (n == 2) return true;
	if (!(n % 2)) return false;
	int rn = sqrt(n);
	vector<bool> v(rn+1);
	for(lint i = 3; i <= rn; i += 2) {
		if(!v.at(i)) {
			if (!(n % i)) return false;
			v.at(i) = 1;
			for(lint j = i*i; j <= rn; j += i) {
				v.at(j) = 1;
			}
		}
	}
	return true;
}

int main() {
	string S;
	cin >> S;
	lint N = S.size();

	lint a=0, b=0, c=0, x, y, z;
	multiset<lint> s;
	rep(bit, (1<<(N-1))) {
		a = 0;
		b = 0;
		rep(i, N) {
			b *= 10;
			b += S[i]-'0';
			if (bit & 1<<i) {
				a += b;
				b = 0;
			}
		}
		a += b;
		s.insert(a);
	}
	for (auto t : s) {
		if (isPrime(t)) c++;
	}
	std::cout << c << '\n';
}