from math import ceil


def solve():
    n = int(input())
    l = 1
    ans = 0
    while l <= n:
        r = n // (n // l)
        k = n // l
        ans += k * (r - l + 1)
        l = r + 1

    return ans

for i in range(int(input())):print(solve())