import math
t=int(input())
for _ in range(t):
    n=int(input())
    ans=n*(2*n-1)
    for i in range(1, 31):
        for j in range(1, 31):
            k=max(i, j)
            if k==1 or math.gcd(i, j)>1:
                continue
            l=1
            r=32000
            while r-l>1:
                m=(l+r)//2
                if m**k<=n:
                    l=m
                else:
                    r=m
            ans+=n//k*(l-1)
    print(ans)