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

#define rep(i, n) for(ll i = 0; i < n; i++)
#define rep2(i, m, n) for(ll i = m; i <= n; i++)
#define rrep(i, m, n) for(ll i = m; i >= n; i--)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define MAX(x) *max_element(all(x))
#define MIN(x) *min_element(all(x))
#define SZ(a) ((ll)(a).size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int dx[4] = { -1, 1, 0, 0 };
const int dy[4] = { 0, 0, 1, -1 };
const int inf = 1e9 + 1;
const ll INF = 1e18;
const double pi = acos(-1);

using Graph = vector<vector<ll>>;
using REV_PQ = priority_queue<int, vector<int>, greater<int>>;
using PQ = priority_queue<int>;

//typedef atcoder::modint998244353 mint;
//typedef atcoder::modint1000000007 mint;


struct Edge { ll u, v, cost; };

bool comp(const Edge& e1, const Edge& e2) {
    return e1.cost < e2.cost;
}


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

    string s; cin >> s;

    int n = SZ(s);

    int res = 0;
    rep(i, 1 << (n - 1)) {

        ll sum = 0;
        ll cur = (ll)(s[0] - '0');
        rep(j, n - 1) {
            if ((i >> j) & 1) {
                sum += cur;
                cur = (ll)(s[j + 1] - '0');
            }
            else {
                cur = cur * 10 + (ll)(s[j + 1] - '0');
            }
        }
        sum += cur;

        bool ok = true;
        for (ll j = 2; j * j <= sum; j++) {
            if (sum % j == 0) ok = false;
        }

        if (ok) res++;
    }

    cout << res << endl;
}