cpp
1#include
2using namespace std;
3const int N = 5e3+10;
4bool st[N], gb[N];
5int primes[N], idx;
6void lineSieve() {
7for (int i = 2; i < N; i++) {
8 if (!st[i]) {
9 primes[idx++] = i;
10 }
11 for (int j = 0; j < idx && primes[j] <= N / i; j++) {
12 st[i*primes[j] * i] = 1;
13 if (i % primes[j] == 0) {
14 break;
15 }
16 }
17}
18}
19void goldSieve() {
20for (int i = 1; i < idx; i++) {
21 for (int j = i; j < idx && primes[i] <= N - primes[j]; j++) {
22 gb[primes[i] + primes[j]] = 1;
23 }
24}
25}
26int main() {
27lineSieve();
28goldSieve();
29int Q;
30cin >> Q;
31while (Q--) {
32 int t;
33 scanf("%d", &t);
34 if (gb[t]) {
35 printf("okk\n");
36 } else {
37 printf("something wrong\n");
38 }
39}
40return 0;
41}