import java.math.BigInteger;

import java.util.Scanner;

public class Main{

	public static final int maxn = 3000 + 5;

	public static BigInteger []ans;

	public static void main(String[] args){

		Scanner cin = new Scanner(System.in);

		int T = cin.nextInt();

		ans = new BigInteger[maxn];

		ans[0] = BigInteger.ONE;

		for(int i = 1; i <= 3000; ++i)

			ans[i] = ans[i-1].multiply(BigInteger.valueOf(32));

		for(int kase = 1; kase <= T; ++kase){

			int n = cin.nextInt();

			System.out.println("Case #" + kase + ": " + ans[n]);

		}

	}

}