#include <bits/stdc++.h>
using namespace std;
const int N = 100000 + 2;
bool v[N];
vector<int> p[N][7];
int a[7][7], len;
void init() {
  for (int i = 2; i < N - 2; ++i) {
    if (!v[i]) {
      if (i <= N / i) {
        for (int j = i * i; j < N - 2; j += i) {
          v[j] = true;
        }
      }
      int x = i;
      for (int j = 1; j < 5; ++j) {
        x /= 10;
        p[x][j].push_back(i);
      }
    }
  }
}
int dfs(int deep) {
  int num = 0, ret = 0;
  for (int i = 0; i < deep; ++i) {
    num *= 10;
    num += a[deep][i];
  }
  if (deep == len - 1) return p[num][1].size();
  for (int i = 0; i < p[num][len - deep].size(); ++i) {
    int x = p[num][len - deep][i];
    for (int j = len - 1; j >= deep; --j, x /= 10) {
      a[deep][j] = a[j][deep] = x % 10;
    }
    ret += dfs(deep + 1);
  }
  return ret;
}
int main() {
  init();
  int t;
  scanf("%d", &t);
  while (t--) {
    char ch[7];
    scanf("%s", ch);
    len = strlen(ch);
    for (int i = 0; i < len; ++i) a[i][0] = a[0][i] = ch[i] - '0';
    printf("%d\n", dfs(1));
  }
  return 0;
}
