UVALive 6657 GCD XOR

//By--wintermelon
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N=30000005;
int ans
;
int n;
void fuck() {
    int ran=30000000;
    memset(ans,0,sizeof(ans));
    for(int c=1; c<=ran; c++) {
        for(int a=c+c; a<=ran; a+=c) {
            int b=a-c;
            if((a^b)==c) {
                ans[a]++;
            }
        }
    }
    for(int i=1; i<=ran; i++) {
        ans[i]+=ans[i-1];
    }
}
int main() {
#ifdef ONLINE_JUDGE
#else
    freopen("test.in", "r", stdin);
#endif
    fuck();
    int T;
    int ca=1;
    scanf("%d",&T);
    while(T--) {
        scanf("%d",&n);
        printf("Case %d: %d\n",ca++,ans
);
    }
    return 0;
}