#include<stdio.h>
#include<math.h>
int main(){
int *A;
int P[10000]={0};
int i=0,j=0,k=0;
int n=(int)sqrt(10000);
long t=0;
A=(int*)calloc(sizeof(int),10001);
//Sieve Method starts here
for(i=2;i<=n;i++){
if(A[i]==0){
for(j=i*i;j<=10000;j=j+i)
A[j]=1;
}
}
j=0;
for(i=2;i<=10000;i++){
if(A[i]==0)
P[j++]=i;
}
//sieve method ends here
free(A);
A=(int*)calloc(sizeof(int),10001);
for(i=0;i<j;i++){
for(k=0;(P[i]+2*P[k])<=10000;k++){
if(k!=i)
A[P[i]+2*P[k]]++;
}
}
scanf("%ld",&t);
while(t-- > 0){
scanf("%ld",&j);
printf("%d\n",A[j]);
}
//getch();
return 0;
}