Euler theorem

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 524288/524288 K (Java/Others)

Description

HazelFan is given two positive integers $a,b$, and he wants to calculate $a\mod b$. But now he forgets the value of $b$ and only remember the value of $a$, please tell him the number of different possible results.

Input

The first line contains a positive integer $T(1\leq T\leq5)$, denoting the number of test cases.
For each test case:
A single line contains a positive integer $a(1\leq a\leq10^9)$.

Output

For each test case:
A single line contains a nonnegative integer, denoting the answer.

Sample Input

2 1 3

Sample Output

2 3

Hint

liuyiding

Source

2017 Multi-University Training Contest - Te

提交代码