MOD = 10 ** 9 + 7
INF = 10 ** 10
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)
from math import gcd

def root_int(a,k):
    if k == 0:
        return 0
    x = int(a ** (1 / k))
    while (x ** k) > a:
        x -= 1
    while ((x + 1) ** k) <= a:
        x += 1
    return x

def main():
    t = int(input())
    for _ in range(t):
        n = int(input())
        ans = n * n
        for b in range(1,35):
            for d in range(1,35):
                if gcd(b,d) != 1:
                    continue
                lim1 = max(root_int(n,max(b,d)),1) - 1
                lim2 = n//max(b,d)
                ans += lim1 * lim2
        print(ans)

if __name__ =='__main__':
    main()