#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using mint = modint998244353;

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

ll calc(string t) {
  vector<ll> v;
  string tmp;
  for (int i = 0; i < t.size(); i++) {
    if (t[i] == '+') {
      //cout << t << ' ' << tmp << endl;
      v.push_back(stoll(tmp));
      tmp = "";
    } else {
      tmp += t[i];
    }
  }
  //cout << t << ' ' << tmp << endl;
  v.push_back(stoll(tmp));
  ll res = 0;
  for (int i = 0; i < v.size(); i++) {
    res += v[i];
  }
  return res;
}

int main() {
  ll res = 0;
  string s; cin >> s;
  int n = s.size();
  for (ll b = 0; b < (1LL << n - 1); b++) {
    string t;
    for (int i = 0; i < n; i++) {
      t += s[i];
      if (i < n - 1 && b >> i & 1) {
        t += '+';
      }
    }
    res += is_prime(calc(t));
  }
  cout << res << endl;
  return 0;
}