## Problem: Maximum Draws

*Difficulty: Baby step

Problem:

Jim is off to a party and is searching for a matching pair of socks. His drawer is filled with socks, each pair of a different color. In its worst case scenario, how many socks (x) should Jim remove from his drawer until he finds a matching pair?

Input Format
The first line contains the number of test cases T.
Next T lines contains an integer N which indicates the total pairs of socks present in the drawer.

Output Format
Print the number of Draws (x) Jim makes in the worst case scenario.

Constraints

1 <= T <= 1000
0 < N < 10^6 

Sample Input

2
1
2


Sample Output

2
3


Explanation
Case 1 : A pair of socks are present, hence exactly 2 draws for the socks to match.
Case 2 : 2 pair of socks are present in the drawer. The first and the second draw might result in 2 socks of different color. The 3rd sock picked will definitely match one of previously picked socks. Hence, 3.

How to solve:
If you got 3 pairs of socks, then you got total three colors. After first 3 draws, the worst scenario is color 1, color 2, color 3. Then the fourth draw must be one of the colors that we got.
If you got 4 pairs of socks, then you got total four colors. After first 4 draws, the worst scenario is color 1, color 2, color 3, color 4. Then the fifth draw must be one of the colors that we got.
So on …
Let n is the number of pair of socks, then just print out n + 1.