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

bool prime(long long n) {
    bool ret = true;
    if(n == 1) ret = false;
    for(int i=2;i<sqrt(n) + 1;i++) {
        if(n % i == 0) {
            ret = false;
            break;
        }
    }

    return ret;
}

int main() {
    string s;
    cin >> s;
    int n = s.size() - 1;
    int out = 0;
    for(int i=0;i<(1<<n);i++) {
        bitset<9> b(i);
        int tmp = 0;
        long long total = 0;
        for(int j=0;j<n;j++) {
            if(b.test(j)) {
                string sub = s.substr(tmp, (j - tmp) + 1);

                tmp = j + 1;

                total += stoll(sub);
            } 
        }
        total += stoll(s.substr(tmp, (n - tmp) + 1));

        if(prime(total)) out++;
    }

    cout << out << endl;
}