# KK's Point

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 65536/65536 K (Java/Others)

## Description

Our lovely KK has a difficult mathematical problem:He points $N\left(2\leq N\leq {10}^{5} \right)$ points on a circle,there are all different.Now he's going to connect the $N$ points with each other(There are no three lines in the circle to hand over a point.).KK wants to know how many points are there in the picture(Including the dots of boundary).

## Input

The first line of the input file contains an integer $T\left( 1\leq T\leq 10\right)$, which indicates the number of test cases.

For each test case, there are one lines,includes a integer $N\left(2\leq N\leq {10}^{5} \right)$,indicating the number of dots of the polygon.

## Output

For each test case, there are one lines,includes a integer,indicating the number of the dots.

## Sample Input

2
3
4

## Sample Output

3
5

hujie

## Source

BestCoder Round #71 (div.2)