Time Limit: 3000 MS    Memory Limit: 65536 K 


Description

There is a romantic line called sawthooth II which consists of two parallel infinite half-lines joined by a straight segment. It looks like a character Z. You are given N Z lines, can you calculate the maximum number of regions they can divide the plane?

Input

The first line is an integer T which stands for the number of test cases. Then it follows T test cases. Each test case has only one line contains only one integer N (0 <= N <= 10^9).

Output

For each test case, print one line containing an integer which stands for the maximum number of regions they can divide the plane.

Sample Input

2 1 2

Sample Output

2 12

Author

lne

Source

Sichuan University Programming Contest 2011 Preliminary