A divisor of n is the an integer which can divides n.
Let's call f(n) is the number of divisors of n.For example,f(4) is 3,that is 1,2,4.
Now please calculate s(n) which s(n) equals f(1) + f(2) + f(3) + ... + f(n).
Divisorcounting
Input
First line contains a integer T which is the number of test cases.(T<=10^2)
And there are T lines later,which contains a interger N.(1<=N<=10^12)
And there are T lines later,which contains a interger N.(1<=N<=10^12)
Output
For each test case, you should output one line contaning only one integer s(N).
Sample Input
3
2
4
5
Sample Output
3
8
10