func_code_string: #include <bits/stdc++.h>   using namespace std;   const int maxn = 100000;   bool isprime[maxn];   int p[5], s[5], n;   const int tenpow[6] = {1, 10, 100, 1000, 10000, 100000};   int tenpowmul[6][10];   int getd[maxn][5];   int ans;   bool good[2 * maxn][6];   int tans[maxn];   void solve(int i) {     if (i == 0) {       for (int i = 0; i < n; ++i) s[i] = tenpowmul[n - 1][getd[p[0]][n - 1 - i]];       solve(i + 1);     } else if (i + 1 == n)       ans += tans[s[i]];     else       for (int j = 0; j < tenpow[n - i]; ++j)         if (isprime[s[i] + j]) {           p[i] = s[i] + j;           int y[5], k;           for (k = i; k < n; ++k) {             s[k] += (y[k] = tenpowmul[n - i - 1][getd[p[i]][n - k - 1]]);             if (!good[s[k]][n - i]) break;           }           if (k == n) solve(i + 1), k--;           for (; k >= i; --k) s[k] -= y[k];         }   }   int main() {     for (int i = 0; i < (int)(6); ++i)       for (int j = 0; j < (int)(10); ++j) tenpowmul[i][j] = tenpow[i] * j;     for (int i = 0; i < (int)(maxn); ++i)       for (int j = 0; j < (int)(5); ++j) getd[i][j] = (i / tenpow[j]) % 10;     for (int i = (int)(2); i <= (int)(maxn); ++i) isprime[i] = 1;     for (int i = 2; i * i < maxn; ++i)       if (isprime[i])         for (int j = i * i; j < maxn; j += i) isprime[j] = 0;     for (int i = 0; i < (int)(maxn); ++i) good[i][0] = isprime[i];     for (int j = (int)(1); j <= (int)(5); ++j)       for (int i = 0; i < (int)(maxn); ++i)         for (int k = 0; k < (int)(10); ++k)           good[i][j] |= good[i + tenpowmul[j - 1][k]][j - 1];     for (int i = 0; i < (int)(maxn); ++i)       if (i % 10 == 0)         for (int k = 0; k < (int)(10); ++k) tans[i] += isprime[i + k];     int T;     cin >> T;     for (int _t = 0; _t < (int)(T); ++_t) {       cin >> p[0];       int k = 1;       n = 0;       while (k <= p[0]) k *= 10, n += 1;       for (int i = (int)(1); i <= (int)(n - 1); ++i) p[i] = 0;       ans = 0;       solve(0);       cout << ans << endl;     }     return 0;   }   