Given an integer N, denoting the number of cuts that can be made on a pancake, find the maximum number of pieces that can be formed by making N cuts.
The first line of input contains a single integer T denoting the number of test cases. Then T test cases follow. Each test case consist of one line. The first line of each test case consists of an integer N.
Corresponding to each test case, in a new line, print the maximum number of pieces that can be formed by making N cuts .
1 ≤ T ≤ 100
1 ≤ N ≤ 106
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?Yes