Maximum GCD#2631
Sign in

Maximum GCD

1 second
128 megabytes
Very easy

Given integers, find the maximum GCD (greatest common divisor) among all possible pairs of these integers.

Input

The first line contains the number of test cases (1 \leq t \leq 100).

Each of the following lines contains (1 \leq n \leq 100) natural numbers.

Output

For each test case, print on a separate line the maximum GCD among all possible pairs of integers.

Examples

Example 1

Loading
Loading

Note

For the first test case, the answer is \gcd(20, 40) = 20.

For the third test case, the answer is \gcd(125, 25) = 25.