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

int main()
{
    long long int n,t,i,k,l,m,sum;
    scanf("%lld",&t);
    for(i=1; i<=t; i++)
    {

        scanf("%lld",&n);
        vector<long long int>a;
        while(n!=0)
        {
            a.push_back(n%2);
            n=n/2;

        }

        reverse(a.begin(),a.end());
        next_permutation(a.begin(),a.end());
        reverse(a.begin(),a.end());
        for(k=0,sum=0;k<a.size();k++)
            sum=sum+(a[k]*pow(2,k));
        printf("Case %lld: %lld\n",i,sum);

    }



return 0;
}