1. 
/**
* ACM Training 2010
* ACM Problem #11609 - Teams
* Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=78&page=show_problem&problem=2656
*
* @author Felix Dietrich
* @version 1.0, 30/05/2010
*
* Methode: Schnelle exponentiation
* Status : Accepted
* Runtime: 0.270
*/

import java.io.IOException;
import java.util.*;

public class Main
{
// wikipedia fast exponentiation
public static long fastExp(long x, long n, long mod)
{
long result = 1;
while (n > 0) {
/* n is odd, bitwise test */
if ((n & 1) != 0) {
result = (result*x) % mod;
n-=1;
}
x = (x*x) % mod;
n /= 2; /* integer division, rounds down */
}
return result % mod;

}

public static void main(String... strs) throws NumberFormatException, IOException
{
Scanner sc = new Scanner(System.in);

long cases = sc.nextInt();
long result = 0;
long input = 0;
long m = 1000000007;

for(int i=0; i<cases; i++)
{
input = sc.nextInt();
System.out.println("Case #"+(i+1)+": "+(input*fastExp(2,input-1,m)%m));
}
}
}