#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using Graph = vector<vector<int> >;
using PI = pair<int, int>;
using PL = pair<ll, ll>;

#define rep(i, a, b) for(int i = a; i < b; i++)
#define rep_ll(i, a, b) for(ll i = a; i < b; i++)
#define rrep(i, a, b) for(int i = a; i >= b; i--)
#define fore(i, a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()

const int INFI = 1 << 29;
const ll INFL = 1LL << 59;

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

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

    ll s; cin >> s;
    vector<ll> A;
    ll n = 0;
    while (s) {
        A.push_back(s % 10);
        s /= 10;
        n++;
    }
    reverse(all(A));

    int ans = 0;
    rep(bit, 0, 1 << (n-1)) {
        ll tmp = 0;
        ll check = 0;
        rep(i, 0, n) {
            tmp += A[i];
            if (bit & (1 << i)) {
                check += tmp;
                tmp = 0;
            }
            else if (i == n-1) check += tmp;
            else tmp *= 10;
        }
        if (isprime(check)) ans++;
    }

    cout << ans << endl;
}