t = int(input())

m = 10 ** 7
totient = [i for i in range(m + 1)]
prime = [None for _ in range(m + 1)]

for x in range(2, m + 1):
  if not prime[x] is None:
    continue

  prime[x] = True
  totient[x] *= (x - 1)
  totient[x] //= x
  for y in range(2 * x, m + 1, x):
    totient[y] *= (x - 1)
    totient[y] //= x
    prime[y] = False

dp = [0 for _ in range(m + 2)]
for x in range(1, m + 1):
  dp[x] = dp[x - 1] + totient[x]

for _ in range(t):
  n = int(input())
  print(dp[n] + (n * (n - 1) // 2 - dp[n]) * 2 + 1)