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

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

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

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

有點摸不著頭腦，不是很懂(｡･∀･)ﾉﾞ

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>

using namespace std;

int main(){
    long long n,ans,t,i;
    cin>>t;
    while(t--){
        cin>>n;
        ans = 0;
        for( i = 1 ; i*i <= n ; ++i ){
            ans += n/i;
        }
        ans *= 2;
        i--;
        ans = ans - i*i-n;
        cout<<ans<<endl;
    }
    return 0;
}