F(n) = C(n,1)*1 + C(n,2)*2 + ... = sum(C(n,i)*i)=n * 2^(n-1)
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#define ll long long
#define mod 1000000007
using namespace std;
ll ppow(ll x,ll n) {
ll tp=1;
while(n)
{
if(n&1) tp=tp*x%mod;
n>>=1;
x=x*x%mod;
}
return tp;
}
int main(){
int T;
ll n;
cin>>T;
for(int i=1;i<=T;i++){
cin>>n;
cout<<"Case #"<<i<<": "<<(n*ppow(2,n-1))%mod<<endl;
}
return 0;
}