import sys
readline = sys.stdin.readline
 
#n = int(readline())
#*a, = map(int,readline().split())
# b = [list(map(int,readline().split())) for _ in range()]

def enumerate_tortient(N):
    primes = []
    lpf = [0]*(N+1) # least prime factor
    tor = [1]*(N+1); tor[0] = 0
    for x in range(2,N+1):
        if lpf[x] == 0:
            lpf[x] = x
            primes.append(x)
            tor[x] = x-1
        for p in primes:
            if p > lpf[x] or x*p > N: break
            lpf[x*p] = p
            tor[x*p] = tor[x]*(p if lpf[x] == p else p-1)
    return tor

T = int(readline())

N = 10**7
tor = enumerate_tortient(N)
print(tor)
tor[1] -= 1
for i in range(1,N+1):
    tor[i] += tor[i-1]

for _ in range(T):
    n = int(readline())
    print(n*(n-1) - tor[n])