#include<algorithm>
#include<iostream>
#include<vector>
#include<map>
#include<cassert>
#include<set>
#include<queue>
using namespace std;
using ll = long long;


string s;
int ans;
void dfs(ll now,ll tmp,int ni){
    int n = s.size();
    if(ni==n){
        now += tmp;
        bool fn = false;
        if(now==1) fn = true;
        for(ll i = 2;i*i<=now;i++){
            if(now%i==0)fn = true;
        }
        if(!fn) ans++;
        return;
    }

    if(ni!=0){
        ll nxt = now + tmp;
        ll t = s[ni] - '0';
        dfs(nxt,t,ni+1);
    }
    tmp *= 10;
    tmp += s[ni] -'0';
    dfs(now,tmp,ni+1);
}



int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    cin>>s;
    dfs(0,0,0);
    cout<<ans<<endl;

}