As an acmer, Devil Aguin particularly loves numbers. This time, with a sequence consisting of n elements 1∼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.

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

     of each next T lines contains one integer n(), the number of sequence.

For each test case print a number, the minimum number of operations required.

2
1
2

1
2