MAX_N=10**7+100
totient=[i for i in range(MAX_N+1)]
isPrime=[True for i in range(MAX_N+1)]
isPrime[0]=False;isPrime[1]=False
for i in range(MAX_N+1):
    if isPrime[i]:
        totient[i]-=1
        for j in range(2*i,MAX_N+1,i):
            isPrime[j]=False
            totient[j]-=totient[j]//i
sum_totient=[0 for i in range(MAX_N+1)]
for i in range(1,MAX_N+1):
    sum_totient[i]=sum_totient[i-1]+totient[i]

T=int(input())
for _ in range(T):
    N=int(input())
    res=sum_totient[N]*2-1
    ans=(2*N*N-res)
    ans-=2*N-1
    ans//=2
    print(ans)