import java.io.*;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int t = Integer.parseInt(br.readLine());
        
        while(t-- > 0) {
            int n = Integer.parseInt(br.readLine());
            int count = 0;
            boolean[] prime = new boolean[n+1];
            prime = prime(prime, n);

            for(int i=2; i<=(n+1)/2; i++) {
                if(!prime[i] && !prime[n-i]) {
                    count++;
                }
            }
            
            System.out.println(count);
        }
    }
    
    public static boolean[] prime(boolean[] prime, int n) {
        prime[0] = true;
        prime[1] = true;
        
        for(int i=2; i*i<=n; i++) {
            if(!prime[i]) {
                for(int j=i*i; j<=n; j+=i) {
                    prime[j] = true;
                }
            }
        }
        
        return prime;
    }
}

'Problem Solving > BOJ' 카테고리의 다른 글

[Silver 5] 11576번 Base Conversion  (0) 2022.03.25
[Silver 5] 11653번 소인수분해  (0) 2022.03.25
[Silver 4] 2089번 -2진수  (0) 2022.03.25
[Silver 2] 17087번 숨바꼭질 6  (0) 2022.03.25
[Silver 3] 9613번 GCD 합  (0) 2022.03.25