Secret Origins

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<30)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
int bts(ll n){
    int ct(0);
    while(n)
        n&=n-1,++ct;
    return ct;
}
int lm(ll N){
    int I(0);
    while(!(N&(1ll<<I)))++I;
    return I;
}
int gn(ll N){
    int b(bts(N)),I(0);
    N+=1<<lm(N);
    while(b>bts(N))N|=1<<I++;
    return N;
}
int main(void){
    IN(tt)F(tt){
        IN(N)printf("Case %d: %d\n",i+1,gn(N));
    }
    return 0;
}