Div 1 Problem E

#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<iostream>
#include<cctype>
#include<map>
#include<stack>
#include<cstdlib>
#include <queue>
#include <vector>
#include<algorithm>
#define ll long long
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
using namespace std;
int main()
{
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
long long int n,t,s,no=0;
scanf("%lld",&t);
while(t--)
{
scanf("%lld",&n);
n=n+1;
s=pow(2,n)-1;
printf("Case %lld: %lld\n",++no,s);
}
return 0;
}