Problem Statement:

George loves drawing recursive shapes; today he draws recursive triangles using matches. Triangles have multiple levels determines by number of matches in one of its sides as following

George defines the term "fragment" as a straight line that contains one or more match. He wants you to help him counting all fragments in a specific level.

Input Format:

First line contains K (1 ≤ K ≤ 100) number of test cases. Each line in the next K lines contains: one positive number representing level (1 ≤ N =2m < 64000).

Output Format:

For each test case your program should print one line contains number of all fragments in level N.

Sample Input:

3
1
2
4

Sample Output:

3
12
60