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.
Input:
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.
Output:
Corresponding to each test case, in a new line, print the maximum number of pieces that can be formed by making N cuts .
Constraints:
1 ≤ T ≤ 100
1 ≤ N ≤ 106
Example:
Input
2
5
3
Output
16
7
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.
mr_kksparrow | 433 |
manvirag982 | 272 |
snow_den_ | 236 |
arpit_anshuman | 228 |
Exception_404 | 220 |
blackshadows | 5331 |
Ibrahim Nash | 5219 |
akhayrutdinov | 5111 |
mb1973 | 4929 |
Quandray | 4567 |