#include <iostream>
#include <cmath>
using namespace std;
typedef long long ll;
int gcd(int a, int b){
	if(b==0) return a;
	return gcd(b, a%b);
}
ll cnt[30], a[30];
ll root(ll n, int k){
	return (ll)pow((long double)n, (long double)(1.0)/k);
}
ll solve(ll n){
	for(int i=1; i<30; i++) a[i]=root(n, i);
	ll ret=n*n;
	for(int i=1; i<30; i++) ret+=n/i*(a[i]-1)*cnt[i];
	return ret;
}
int main()
{
    int t;
	cin>>t;
	for(int i=1; i<30; i++) for(int j=1; j<30; j++) if(gcd(i, j)==1) cnt[max(i, j)]++;
	while(t--){
		ll n;
		cin>>n;
		cout<<solve(n)<<endl;
	}
    return 0;
}