Sourav, Anidya and Subham has joined a job.
Their employer gave them an interesting option. They may choose independently any number x not greater than N They will get paid after every x hours. They want to meet as infrequently as possible but can only do so on the hours they get paid. Can you help them such that they can get together as infrequently as possible?

Input Format
The first line of input contains T denoting the number of test cases.
T lines follow with a single integer N on each line where N is the limit set by their employer.

Output Format
For each test case output the answer K, where K is the maximum interval after which they will meet.

Constraints
$1 \le T \le 10^3$
$1 \le N \le 10^6$