## https://yukicoder.me/problems/no/1022

import math


def calc_gcd(A, B):
    """
    正の整数A, Bの最大公約数を計算する
    """
    a = max(A, B)
    b = min(A, B)
    while a % b > 0:
        c = a % b
        a = b
        b = c
    return b

def solve(N):
    sqrt_n = int(math.sqrt(N))

    answer = (N ** 2)
    used_over_sqrt_n = set()
    used_under_sqrt_n = set()
    for a in range(2, sqrt_n + 1):
        if a in used_under_sqrt_n:
            continue

        arr = []
        x = a 
        while x <= N:
            arr.append(x)
            x *= a

        for x in arr:
            if x <= sqrt_n:
                used_under_sqrt_n.add(x)
            else:
                used_over_sqrt_n.add(x)
        
        x = len(arr)
        for m in range(1, x + 1):
            for n in range(1, x + 1):
                gcd = calc_gcd(m, n)

                lcm = (m // gcd) * n

                m1 = lcm // m
                n1 = lcm // n
                max_mn = max(m1, n1)
                ans = N // max_mn
                answer += ans
    
    n0 = N - sqrt_n - len(used_over_sqrt_n)
    return answer + n0 * N

        
            





def main():
    T = int(input())
    answers = []
    for _ in range(T):
        N = int(input())
        ans = solve(N)
        answers.append(ans)

    for ans in answers:
        print(ans)



        





    



if __name__ == "__main__":
    main()