#include<bits/stdc++.h>
using namespace std;

int main()
{
    long long int n,i,j,k,l,a,b,c,d,e,sum,t;
    vector<int>v;
    cin>>t;
    for(l=1;l<=t;l++)
    {
        cin>>n;
        k=0;
        while(n)
        {
            a=n%2;
            v.push_back(a);
            n/=2;
            k++;
        }
        v.push_back(0);
        reverse(v.begin(),v.end());
        next_permutation(v.begin(),v.end());

        long long int base=1,number=0;
        for(i=k;i>=0;i--)
        {
            if(v[i]==1)
            number+=base;
            base*=2;
        }
        cout<<"Case "<<l<<": "<<number<<endl;
     v.clear();

    }
    return 0;
}