#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

bool is_prime(ll n) {
    if(n < 2) return false;
    if(n == 2) return true;
    if(n % 2 == 0) return false;
    for(ll i = 3; i * i <= n; i += 2) if(n % i == 0) return false;
    return true;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    string s; cin >> s;
    int n = int(s.size());
    int ans = 0;
    rep(S,1<<(n-1)) {
        vector<ll> v = {s[0] - '0'};
        rep(i,n-1) {
            if(S & (1 << i)) {
                v.push_back(s[i + 1] - '0');
            } else {
                v.back() = v.back() * 10 + (s[i + 1] - '0');
            }
        }
        ll sum = accumulate(v.begin(), v.end(), 0LL);
        if(is_prime(sum)) ans++;
    }
    cout << ans << endl;
}