A. Submission is All You Need II
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given a positive integer $$$n$$$. Find the number of different integers $$$x$$$ such that $$$n+(x\mod n)=x$$$.

Input

The first line of the input will contain a single integer $$$t$$$ $$$(1 \le t \le 10^4)$$$  — the total number of test cases.

Each test case contains a single integer $$$n$$$ $$$(1 \le n \le 10^{18}) $$$.

Output

For each test case, output in a new line — the number of different integers $$$x$$$ such that $$$n+(x\mod n)=x$$$.

Example
Input
2
1
2
Output
1
2
Note

In the first test case, only $$$x=1$$$ satisfies the condition.

In the second test case, $$$x=2$$$ and $$$x=3$$$ satisfy the condition.