#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

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

int main(){

    string S;
    cin >> S;
    ll ans=0, sm, N=S.size(), s;

    for (int i=0; i<(1<<(N-1)); i++){
        sm = 0;
        s = S[0]-'0';
        for (int j=0; j<N-1; j++){
            if (!(i & 1<<j)) s = s*10 + (S[j+1]-'0');
            else{
                sm += s;
                s = S[j+1]-'0';
            }
        }
        sm += s;
        if (is_prime(sm)) ans++;
    }

    cout << ans << endl;

    return 0;
}