#include <bits/stdc++.h>

using namespace std;

const int maxn=500000;

typedef long long LL;

const LL mod = 1LL<<32;

LL g[501000],f[501000],fai[501000],ans[501000],sum[501000];
int prime[501000],check[501000];

int main(){
	int T;
	scanf("%d",&T);
	
	//inv2=power(2,mod-2,);

	//fai
	fai[1]=1;
	int tot=0;
	for (int i=2;i<=maxn;i++){
		if (!check[i]){
			prime[tot++]=i;
			fai[i]=i-1;
		}
		for (int j=0;j<tot;j++){
			if (i*prime[j]>maxn) break;
			check[i*prime[j]]=1;
			if (i%prime[j]==0){
				fai[i*prime[j]]=fai[i]*prime[j];
				break;
			}else{
				fai[i*prime[j]]=fai[i]*(prime[j]-1);
			}
		}
	}
	
	
	g[1]=1;
	for (int i=2;i<=maxn;i++){
		g[i]=fai[i]*i/2%mod;
	}

	for (int i=1;i<=maxn;i++){
		for (int j=1;j*j<=i;j++){
			if (i%j==0){
				f[i]+=j;
				if (j*j!=i) f[i]+=i/j;
			}
		}
		f[i]%=mod;
	}

	for (int i=1;i<=maxn;i++){
		for (int j=1;j*j<=i;j++){
			if (i%j==0){
				ans[i]+=f[j]*g[i/j];
				if (j*j!=i) ans[i]+=f[i/j]*g[j];
				ans[i]%=mod;
			}
		}
		ans[i]=ans[i]*i%mod;
	}

	sum[1]=ans[1];
	for (int i=2;i<=maxn;i++){
		sum[i]=sum[i-1]+ans[i];
		sum[i]%=mod;
	}
	//cout << g[1]<<" "<<g[3]<<endl;

	int tcase=0;
	while (T--){
		int k;
		scanf("%d",&k);
		tcase++;
		printf("Case #%d: %lld\n",tcase,sum[k]);
	}
	return 0;
}