Problem Description
Pick two numbers
ai,aj(i≠j) from a sequence to maximize the value of their greatest common divisor.
Input
Multiple test cases. In the first line there is an integer
T , indicating the number of test cases. For each test cases, the first line contains an integer