#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
using namespace std;

typedef long long ll;

int main() {
    string S;
    cin >> S;
    int ans = 0, n = S.size() - 1;
    rep(i, 0, 1 << n) {
        ll t = 0, x = S[0] - '0';
        rep(j, 0, n) {
            if ((i >> j) & 1) {
                t += x;
                x = S[j + 1] - '0';
            } else {
                x = x * 10 + S[j + 1] - '0';
            }
            //cout << "x=" << x << endl;
        }
        t += x;
        bool f = true;
        if (t == 1) f = false;
        for (ll j = 2; j * j <= t; j++) {
            if (t % j == 0) f = false;
        }
        ans += f;
        //cout << t << endl;
    }
    cout << ans << endl;
}