Euler theorem

Problem 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

Source

2017 Multi-University Training Contest - Team 7

https://acm.hdu.edu.cn/showproblem.php?pid=6124