#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) UB(A,x)-LB(A,x)
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
//using mint=modint1000000007;
using mint=modint998244353;
void chmax(ll&a,ll b){a=max(a,b);}
void chmin(ll&a,ll b){a=min(a,b);}
bool prime(ll n){
  if(n==1)return 0;
  ll d=2;
  while(d*d<=n){if(n%d==0)return 0;d++;}
  return 1;
}
signed main(){
  string S;cin>>S;
  ll N=S.size(),ans=0;
  REP(i,1<<(N-1)){
    string T="";
    ll sum=0;
    REP(j,N){
      T+=S[j];
      if((i>>j)&1){
        sum+=stoll(T);
        T="";
      }
    }
    sum+=stoll(T);
    if(prime(sum))ans++;
  }
  cout<<ans<<endl;
  return 0;
}