#include <bits/stdc++.h>
using namespace std;
const int maxnum = 100000 + 10;
int t, p, lim, a[6], upnum, ans, power[6];
bool mark[maxnum];
int dp[maxnum];
void sieve() {
  mark[0] = 1;
  mark[1] = 1;
  mark[2] = 0;
  int i = 2;
  while (i * i <= maxnum) {
    for (int j = 2; i * j < maxnum; j++) mark[i * j] = 1;
    i++;
    while (mark[i] == 1) i++;
  }
}
void backtrack(int step) {
  int n = a[step];
  n = n * power[lim - step + 1];
  int up = a[step] + 1;
  up = up * power[lim - step + 1] - 1;
  for (int i = n; i <= up; i++) {
    if (mark[i] == 0) {
      if (step == lim - 1) {
        ans += dp[a[lim] * 10 + i % 10];
        continue;
      }
      if (step == lim) {
        ans++;
        a[step] = i;
      } else {
        a[step] = i;
        int pp = i;
        for (int j = lim; j > step; j--) {
          a[j] = a[j] * 10 + pp % 10;
          pp /= 10;
        }
        backtrack(step + 1);
      }
      a[step] /= power[lim - step + 1];
      for (int j = step + 1; j <= lim; j++) a[j] /= 10;
    }
  }
}
inline void solve() {
  lim = int(log10(p)) + 1;
  for (int i = 1; i <= 5; i++) a[i] = 0;
  int pp = p;
  a[1] = p;
  for (int i = lim; i >= 2; i--) {
    a[i] = a[i] * 10 + pp % 10;
    pp /= 10;
  }
  ans = 0;
  backtrack(2);
  cout << ans << endl;
}
int main() {
  sieve();
  power[0] = 1;
  for (int i = 1; i <= 5; i++) power[i] = power[i - 1] * 10;
  for (int i = 0; i < 10000; i++)
    for (int j = 0; j <= 9; j++)
      if (mark[i * 10 + j] == 0) dp[i]++;
  cin >> t;
  while (t--) {
    cin >> p;
    solve();
  }
  return 0;
}
