Counting Divisors (square)

Let σ0(n) be the number of positive divisors of n

.

For example, σ0(1)=1

, σ0(2)=2 and σ0(6)=4

.

Let

S2(n)=∑i=1nσ0(i2).

Your task is to find S2(N)

.

First line of Input contains T (1≤T≤10000

), the number of test cases.

Next T

lines contain a single number N. (1≤N≤1012)

For each number N, output a single line containing S2(N).

5
1
2
3
10
100

1
4
7
48
1194