Welcome to ZOJ
 Contests Information Problems Runs Statistics Ranklist Clarification
77 - The 9th Zhejiang University Programming Contest - B
Number of Containers

Time Limit: 1 Second      Memory Limit: 32768 KB

For two integers m and k, k is said to be a container of m if k is divisible by m. Given 2 positive integers n and m (m < n), the function f(n, m) is defined to be the number of containers of m which are also no greater than n. For example, f(5, 1)=4, f(8, 2)=3, f(7, 3)=1, f(5, 4)=0...

Let us define another function F(n) by the following equation:

Now given a positive integer n, you are supposed to calculate the value of F(n).

Input

There are multiple test cases. The first line of input contains an integer T(T<=200) indicating the number of test cases. Then T test cases follow.

Each test case contains a positive integer n (0 < n <= 2000000000) in a single line.

Output

For each test case, output the result F(n) in a single line.

Sample Input

```2
1
4
```

Sample Output

```0
4
```

Author: CAO, Peng
Contest: The 9th Zhejiang University Programming Contest
Submit    Status