Tom is off to a school Annual Day 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 Tom 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) Tom makes in the worst case scenario.
Constraints
1≤T≤1000 0<N<10^6
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.
