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

bool is_prime(long long n) {
    if(n == 1) return false;
    for(long long val = 2; val * val <= n; val++) {
        if(n % val == 0) return false;
    }
    return true;
}

void solve() {  
    string s;
    cin >> s;
    int n = s.size();
    int ans = 0;
    rep(bit, 0, 1<<(n-1)) {
        ll sum = 0, cur = s[0] - '0';
        rep(i, 0, n-1) {
            if(bit & (1<<i)) {
                sum += cur;
                cur = s[i+1] - '0';
            } else {
                cur = 10 * cur + s[i+1] - '0';
            }
        }
        sum += cur;
        ans += is_prime(sum);
    }
    cout << ans << endl;
}

int main() {
    solve();
    return 0;
}