GOO  Game Of Ones
Haba and Goba are brothers, they love binary numbers very much. Today is Haba’s birthday so, his uncle gifted him a 3 bit binary string. Getting the present, both of them are very happy. Now, Goba asked Haba that using 3 bits how many different binary numbers he can write, whose 1^{st} bit is 1 and total how many 1 will be needed to write those numbers. Haba answered he can write 4 different numbers using 3 bits whose first bit is 1 and those numbers are 4(100), 5(101), 6(110) and 7(111) and to write these 4 numbers in binary he will need 8 ‘1’. Now Goba told Haba that he will tell Haba the length of a binary string n and Haba will have to answer that using n bits how many different binary numbers he can write, whose 1^{st} bit is 1 and total how many 1 will be needed to write those numbers. If Haba can answer correctly he will get more binary strings as present. Haba wants to get more binary string as present but, he doesn’t know the answer of the question of Goba for bigger value of n, so now he wants your help. Help him to find the answer.
Input
The first line contains a positive integer number, t (1≤t≤50) indicating the number of test cases. Each test case contains a positive integer number, n (1≤n≤50) indicating the number of bits.
Output
For each test case you have to output two numbers, whose first and second number indicates the answer of Goba’s first and second question respectively.
Example
Input:2
Output:
2
32 3
4 8
hide comments
atishya_20:
20210506 11:01:37
AC IN ONE GO


lakshya1st:
20200830 13:09:47
AC in one GOO!! Apply basic P&C... 

kbhartiya83:
20200427 19:25:46
not a good question. Last edit: 20200427 19:26:07 

prgnit_20:
20181019 22:12:19
observe the pattern!! 

sanyam19:
20180619 09:50:28
nice but easy Q... :) 

nemocptn3m0:
20180604 09:01:10
beware of n=1 

anirudnits:
20171111 13:57:57
AC in one go:) 

zzuwenjie:
20170821 10:34:41
I use %I64d output, get WA, but %lld AC . g++ 

TLE:
20170714 08:34:58
my code is working fine for every test case ..why am i getting wrong answer..can u please check once?


parthsavaliya:
20170712 13:31:29
amit_taps1997 use unsigned long long int 
Added by:  Rofi 
Date:  20160427 
Time limit:  0.100s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 GOSU JSMONKEY 
Resource:  Own problem. Used in NHSPC 2016 Final Round. 