#line 1 "main.cpp"
#include <bits/stdc++.h>
#include <atcoder/all>
// #include "library/templates/template.cpp"
using namespace atcoder;
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

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

long long solve(string S)
{
    int N = S.length();
    int ans = 0;
    for (int bit = 0; bit < 1 << (N - 1); bit++)
    {
        int le = 0;
        ll sum = 0;
        for (int i = 0; i < (N - 1); i++)
        {
            if (bit >> i & 1)
            {
                sum += stoll(S.substr(le, i - le + 1));
                le = i + 1;
            }
        }
        sum += stoll(S.substr(le));
        if (sum > 1 && is_prime(sum))
        {
            ans++;
        }
    }
    return ans;
}

int main()
{
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    string S;
    std::cin >> S;
    auto ans = solve(S);
    std::cout << ans << '\n';
    return 0;
}