#include <iostream>
using namespace std;
bool isPrime(long long n){
    if(n <= 1)return false;
    for(long long i = 2; n >= i*i; i++){
        if(!(n%i))return false;
    }
    return true;
}
int main(){
    string s;cin>>s;
    int a = 0;
    for(int i = 0; (1<<(s.size()-1)) > i; i++){
        long long nw = 0;
        long long sm = 0;
        for(int j = 0; (s.size()-1) > j; j++){
            nw = nw*10+s[j]-'0';
            if(i & (1<<j)){
                sm += nw;
                nw = 0;
            }
        }
        nw = nw*10+s[s.size()-1]-'0';
        sm += nw;
        //cout << sm << endl;
        if(isPrime(sm)){
            a++;
        }
    }
    cout << a << endl;
}