1 1 1
1000000000
2 1
 20 2 15
12698951 55128070 116962690 156763505 188535242 194018601 269939893 428710623 442819431 483000923 516768937 552903993 633087286 656092270 671535141 714291344 717660646 846508634 879748146 937368929
2 7
1 2
2 4
1 19
1 12
1 5
2 18
2 11
1 16
2 1
2 3
2 19
1 17
2 9
2 6
 6 3 10
62417580 78150524 410053501 582708235 630200761 760672946
2 2
1 5
1 2
1 4
2 4
2 1
2 1
1 6
2 5
2 6

NO
 NO
NO
NO
NO
NO
NO
YES
NO
NO
 NO
YES
NO
NO
YES
YES

#include <bits/stdc++.h>
const int MYDD = 1103 + 1e7;
int prime[(int)7e5 + 1103];
bool su[MYDD];
void init() {
  int k = 0;
  memset(su, true, sizeof(su));
  su[0] = su[1] = false;
  for (int j = 2; j < MYDD - 1; j++) {
    if (su[j]) {
      prime[k++] = j;
      for (int l = 2 * j; l < MYDD - 1; l = l + j) su[l] = false;
    }
  }
}
int main() {
  int t;
  scanf("%d", &t);
  init();
  for (int z = 1; z <= t; z++) {
    int n, sum = 0;
    scanf("%d", &n);
    for (int j = 0; prime[j] <= n / 2; j++) {
      if (su[n - prime[j]]) sum++;
    }
    printf("Case %d: %d\n", z, sum);
  }
  return 0;
}
