Mr. Wire Less is not that good at implementing circuit in a breadboard. In his Digital Logic Design course, he has to implement several boolean functions using the breadboard. In a breadboard, inputs are given through the switches and outputs are taken through the LEDs. Each input switch can be either in ground state or in high state. So, if he wishes to implement a boolean function, f(x1, x2, .., xn) that takes n boolean values as input and returns m boolean values as output, he will use n switches and m LEDs. 
Mr. Wire Less can quickly assemble the necessary ICs and wires, but the key problem is testing. While testing he has to check with all possible input combination, to make sure whether the output of LED corresponds to the expected output or not. This is taking too long for him, as most of the switches are jammed and difficult to toggle. 
Mr. Wire Less is asking for help to minimize his time of testing. So, your task is to minimize the total number of switch-toggle throughout the testing.
For example, if Mr. Wire Less has to test a function f(x0, x1) of two variables, he may choose this switching-sequence for testing 00, 11, 10, 01. In this case, the total number of switch-toggle will be 2+1+2 = 5. But if he tests in this sequence 00, 10, 11, 01 total number of toggle will be 1+1+1 = 3.
Given n, you have to output the minimum number of toggle needed for complete testing. Though it seems impractical, he wants you to solve the problem for a very large value of n. But, then the toggle value can be quite big. So, he is completely okay with the toggle value modulo 8589934592 (233).  

-----Input-----
The first line of the input contains a positive integer T(T ≤ 105), denoting the number of test-case. Each of the following T lines contains a single non-negative integer n(n ≤ 1020).

-----Output-----
For every test-case, output a single containing test-case number and the minimum number of switch-toggle modulo 8589934592 (233).

-----Sample----- 
Input   
2
1
2

Output
Case 1: 1
Case 2: 3

Source: codechef | Difficulty: UNKNOWN_DIFFICULTY


Solutions:
mod = 8589934592
list1 = []
for i in range(int(input())):
	x = int(input())
	ans = (pow(2, x, mod) - 1) % mod
	list1.append((i + 1, ans))
for i in list1:
	print(f'Case {i[0]}: {i[1]}')


for i in range(int(input())):
	x = int(input())
	ans = (pow(2, x, 8589934592) - 1) % 8589934592
	sol = 'Case ' + str(i + 1) + ': ' + str(ans)
	print(sol)


for t in range(int(input())):
	n = int(input())
	ans = (1 << n) - 1 if n < 33 else (1 << 33) - 1
	print('Case {}: {}'.format(t + 1, ans))


a = int(input())
for i in range(a):
	b = int(input())
	aa = pow(2, b, 8589934592)
	print('Case', str(i + 1) + ':', (aa - 1) % 8589934592)


import sys

def power(a, n, m):
	r = 1
	c = a
	while n:
		if n & 1:
			r = r * c % m
		n >>= 1
		c = c * c % m
	return r
t = int(input())
a = list()
while t:
	n = int(input())
	n = min(n, 33)
	a.append((1 << n) - 1)
	t -= 1
for i in range(len(a)):
	sys.stdout.write('Case ' + str(i + 1) + ': ' + str(a[i]) + '\n')


t = int(input())
for i in range(1, t + 1):
	n = int(input())
	ans = 2 ** 33
	if n < 33:
		ans = 1
		for j in range(1, n + 1):
			ans = ans * 2
	print('Case {}: {}'.format(i, ans - 1))


c = 1
for test in range(int(input())):
	n = int(input())
	ans = pow(2, n, 8589934592) - 1
	ans = ans % 8589934592
	str1 = 'Case ' + str(c) + ': ' + str(ans)
	print(str1)
	c = c + 1


mod = 8589934592
for _ in range(int(input())):
	n = int(input())
	print('Case', _ + 1, end='')
	print(': ', end='')
	print((pow(2, n, mod) - 1) % mod)


mod = 8589934592

def modexp(a, b):
	ans = 1
	while b != 0:
		if b % 2 == 1:
			ans = ans * a % mod
		a = a * a % mod
		b = b // 2
	return ans
t = int(input())
for i in range(t):
	n = int(input())
	print('Case', i + 1, end='')
	print(':', (modexp(2, n) - 1 + mod) % mod)