The Unsolvable Problem

Time Limit: 1000ms
Memory Limit: 32768KB
This problem will be judged on HDU. Original ID: 4627
64-bit integer IO format: %I64d      Java class name: Main

Description

There are many unsolvable problem in the world.It could be about one or about zero.But this time it is about bigger number.
Given an integer n(2 <= n <= 109).We should find a pair of positive integer a, b so that a + b = n and [a, b] is as large as possible. [a, b] denote the least common multiplier of a, b.

Input

The first line contains integer T(1<= T<= 10000),denote the number of the test cases.
For each test cases,the first line contains an integer n.

Output

For each test cases,print the maximum [a,b] in a line.

Sample Input

3
2
3
4

Sample Output

1
2
3

Source

Language: 
Theme: 
Share Code? 

Powered by NB231 | Current Style: .