import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		new Main().run();
	}
	
	long pow(long a,long n) {
		return n==0?1:(pow(a*a,n/2)*(n%2==1?a:1));
	}
	
	long gcd(long a,long b) {
		return a==0?b:gcd(b%a,a);
	}
	
	long solve(long N) {
		long ret=(N-1)*N+N*N;
		int e=30;
		int[] cnt=new int[e+1];
		for(int u=1;u<=e;++u) {
			for(int v=1;v<=e;++v) {
				if(gcd(u,v)!=1||(u==1&&v==1))continue;
				cnt[Math.max(u, v)]+=N/Math.max(u, v);
			}
		}
		long x=(long)Math.sqrt(N+1);
		for(int i=2;i<=e;++i) {
			while(pow(x,i)>N)--x;
			ret+=(x-1)*cnt[i];
		}
		return ret;
	}
	
	void run() {
		Scanner sc=new Scanner(System.in);
		int T=sc.nextInt();
		if(!(1<=T&&T<=50))throw new AssertionError();
		long[] N=new long[T];
		for(int i=0;i<T;++i) {
			N[i]=sc.nextLong();
			if(!(1<=N[i]&&N[i]<=1e9))throw new AssertionError();
			System.out.println(solve(N[i]));
		}
	}
}