pairs-1
Source: hackerearth
Difficulty: EASY

Given T test cases. Each test case contains a number N. Print how many pairs (i, j) exists such that i*j ≤ N.

Constraints

1 ≤ T ≤ 10^5
1 ≤ N ≤ 5*10^5

SAMPLE INPUT
4
1 2 3 4

SAMPLE OUTPUT
1
3
5
8