#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
    void add(X &x, const Y &y) {
        x = (x + y);
        if(x >= MOD) x -= MOD;
    }

template<class X, class Y>
    void sub(X &x, const Y &y) {
        x = (x - y);
        if(x < 0) x += MOD;
    }

/* Author : Le Ngoc Bao Anh, 11A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 1e5 + 10;

bool prime[200];
ll dp[20][200][200][5];
vector<int> digit;
ll n;

ll DP(int index, int x, int y, int hold) {
    if(index == digit.size()) {
        if(prime[x] && prime[y] && !hold) return 1;
        return 0;
    }

    if(dp[index][x][y][hold] != -1) return dp[index][x][y][hold];
    ll &res = dp[index][x][y][hold];
    res = 0;

    for(int i = 0; i <= 9; i++) {
        for(int j = 0; j <= 9; j++) {
            for(int t = 0; t <= 2; t++) {
                int sum = (i + 2 * j + t);
                if(sum / 10 != hold) continue;
                if(sum % 10 != digit[index]) continue;
                res += DP(index + 1, x + i, y + j, t);
            }
        }
    }

    return res;
}

void solve() {
    cin >> n;
    for(int i = 2; i <= 140; i++) prime[i] = 1;
    for(int i = 2; i <= 140; i++) {
        if(prime[i]) {
            for(int j = 2 * i; j <= 140; j += i) prime[j] = 0;
        }
    }

    ll v = n;
    while(v > 0) {
        digit.pb(v % 10);
        v /= 10;
    }
    reverse(all(digit));
    for(int i = 0; i <= 15; i++) {
        for(int j = 0; j <= 140; j++) {
            for(int k = 0; k <= 140; k++) {
                for(int t = 0; t <= 2; t++) {
                    dp[i][j][k][t] = -1;
                }
            }
        }
    }

    cout << DP(0, 0, 0, 0);
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #else
    //online
    #endif

    int tc = 1, ddd = 0;
    // cin >> tc;
    while(tc--) {
        //ddd++;
        //cout << "Case #" << ddd << ": ";
        solve();
    }
}