#include <cstdio>

const int N = 1e5 + 5;
int p[N], m, f[N];
bool v[N];

int main() {
    freopen("plus.in", "r", stdin);
    freopen("plus.out", "w", stdout);
    for (int i = 2; i < N; ++i) {
        if (!v[i]) p[++m] = i;
        for (int j = 1; j <= m && i * p[j] < N; ++j) {
            v[i*p[j]] = 1;
            if (i % p[j] == 0) break;
        }
    }
    for (int i = 1; i <= m && p[i] * 2 < N; ++i) {
        f[p[i]*2]++;
        for (int j = i + 1; j <= m && p[i] + p[j] < N; ++j)
            f[p[i]+p[j]] += 2;
    }
    int T; scanf("%d", &T);
    while (T--) {
        int x; scanf("%d", &x);
        long long s = 0;
        for (int i = 4; i + i < x; ++i)
            s += f[i] * f[x-i] * 2;
        if (!(x & 1)) s += f[x>>1] * f[x>>1];
        printf("%lld\n", s);
    }
    return 0;
}