The number of submissions of CodeChef from Students of Graphic Era University had been growing since the day the CodeChef campus chapter, GEU_Coders had been formed here. This rise in user submissions alerted the staff members at CodeChef. They started to track user activities of students from Graphic Era University. They noted a particular pattern in growth of submissions. Every day starting from 15^th Feb, 2015 (which is the date when GEU_Coders started) they took note of the number of user submission from students of Graphic Era University. They observed that the number of submissions was growing in the following manner:
2 3 7 13 27…
CodeChef was hosting a major contest where it was expecting a huge traffic, the contest is scheduled N days from the day GEU_Coders started. They need to take preparation to manage the traffic on that day. Assuming that the sequence will continue growing in the same manner as that in the present, they would like to know how many user submissions would be there from the students of Graphic Era University on the N^th day.
Note: You are required to submit an iterative solution and not a recursive one.

Input
The first line of input contains T, the number of test cases. T lines follow each consisting of the value N.

Output
For each test case output the number of user submissions from Graphic Era University on the N^th day.

Constraints

1 ≤ T ≤ 100
1 ≤ N ≤ 20

Example
Input:
2
4
7

Output:
13
107

见题面

见题面