Kael'thas has a magic square which contains all points on the 2D plane whose coordinates are integers within [0,n]
He can draw several straight fire lines on the plane. Each line will cover all the points on it. Note that the lines have no endpoints and extend to infinity in both directions.
And there is one special rule: he cannot draw a line that covers the point (0,0) because his throne is on (0,0)
What is the minimum number of lines he needs to draw so that the lines will cover all the points of the magic square except (0,0)?
The input consists of multiple test cases.
The first line contains one integer T (1≤T≤50) denoting the number of test cases.
The following are T test cases.
Each test case consists of one line containing one integer n (0≤n≤50).
1
24