#include<iostream>
using namespace std;
typedef long long ll;
const ll mod=10007;
ll pow(ll n)
{
ll ans=1,base=2;
while(n)
{
if(n&1) ans=ans*base%mod;
base=base*base%mod,n>>=1;
}
return ans;
}
int main()
{
ll t,n,cas=1;
cin>>t;
while(t--)
{
cin>>n;
cout<<"Case #"<<cas++<<": "<<3336*(pow(n-1)+4+(n&1))%mod<<endl;
}
return 0;
}
09-14
09-14
09-14
09-14