# calculate φ(n)
def euler_phi(n):
    res = n
    x = 2
    while x*x <= n:
        if n % x == 0:
            res = res // x * (x-1)
            while n % x == 0:
                n //= x
        x += 1
    if n > 1:
        res = res // n * (n-1)
    return res


M=10**7+1
*phi, = range(M+1)
for x in range(2, M+1):
    if phi[x] == x:
        for y in range(x, M+1, x):
            phi[y] = phi[y] // x * (x-1)
           
ans=[0,0]
for i in range(2,M+1):
  d=ans[-1]
  d+=2*(i-1)-phi[i]
  ans.append(d)
  
T=int(input())
for _ in range(T):
  S=int(input())
  print(ans[S])