#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <atcoder/modint>
using namespace std;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i,n) for(int i=0; i<(n); i++)

using m32 = atcoder::static_modint<1'000'000'007>;

bool isprime(long long n){
  if(n<2) 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;
  int N=S.size();
  int ans = 0;
  rep(i,1<<(N-1)){
    long long v=0, c=S[0]-'0';
    rep(d,N-1){
      if((i>>d)&1){ v+=c; c=0; }
      c = c*10 + S[d+1]-'0';
    }
    if(isprime(v+c)) ans++;
  }
  cout << ans << endl;
  return 0;
}




struct ios_do_not_sync {
    ios_do_not_sync() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;