uva 11609

#include<cstdio>#include<cstring>#define MOD 1000000007using namespace std;long long qcal(int n){     long long res=1,t=2;     while(n)     {     if(n&1)     res=(res*t)%MOD;     t=(t*t)%MOD;     n>>=1; } return res;}int main(){int T,n,t=1;scanf("%d",&T);while(T--){scanf("%d",&n);long long ans=(n*qcal(n-1))%MOD;printf("Case #%d: %lld\n",t++,ans);}}