3070: Trial of Devil

As an acmer, Devil Aguin particularly loves numbers. This time, with a sequence consisting of $n$ elements $1 \sim n$ initially, Devil Aguin asks you to process the sequence until all the elements in it turn to zero.


What you can do in one operation are as following :

1. Select some elements from the sequence arbitrarily.
2. Select a positive integer $x$ arbitrarily.
   
3. Subtract $x$ from the elements you select.

It is obvious that there are various methods to make elements of the sequence turn to zero. But Devil Aguin demands of you to use the minimum operations. Please tell him how many operations you will use.  

The first line contains an integer number T, the number of test cases.

$i^{th}$ of each next T lines contains one integer $n$($1 \leq n \leq 100$), the number of elements in sequence.

2
1
2

1
2