本地测了四五组大数据，跑的比 std 和我同学都快，但是交上去就是 T。有没有好心人看看啊 QAQ

#pragma GCC diagnostic error "-std=c++14"
#pragma GCC target("avx")
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#include<iostream>
#include<cmath>
typedef unsigned long long ull;
const ull N=1e12+5,SQRTN=1e6+5;

namespace IO{
    ull read(ull ret=0,char ch=getchar()){
	while(!isdigit(ch)) ch=getchar();
	while(isdigit(ch)) ret=ret*10+ch-'0',ch=getchar();
	return ret;
    }
    void abswrite(ull x){if(x>9) abswrite(x/10);putchar(x%10+'0');}
    void write(ull x){abswrite(x),putchar('\n');}
}using IO::read;using IO::write;

int cntp,cntnum;
ull n,sqrtn,pri[SQRTN<<1],num[SQRTN<<2];
bool vis[SQRTN<<1];

struct hash_table{
    ull a[SQRTN<<2];
    ull& operator [](ull x){return a[x<=sqrtn?x:sqrtn+n/x];}
}s,t;

ull sieve(ull n,int k){
    if(pri[k]>=n) return 0;
    ull ret=s[n]-k*3;
    for(int i=k+1;i<=cntp&&pri[i]*pri[i]<=n;++i){
	ull cur=pri[i];
	for(int c=1;cur<=n;++c,cur*=pri[i])
	    ret+=(2*c+1)*(sieve(n/cur,i)+(c!=1));
    }
    return ret;
}

signed main(){
    for(int i=2;i<(int)SQRTN;++i){
	if(!vis[i]) pri[++cntp]=i;
	for(int j=1;j<=cntp&&i*pri[j]<SQRTN;++j){
	    vis[i*pri[j]]=1;
	    if(i%pri[j]==0) break;
	}
    }
    for(int tes=read();tes;--tes){
	n=read(),cntnum=0,sqrtn=ceil(sqrt(n));
	for(ull l=1;l<n;l=n/(n/l)+1) num[++cntnum]=n/l,s[n/l]=n/l-1;
	for(int i=1;i<=cntp;++i)
	    for(int j=1;pri[i]*pri[i]<=num[j];++j)
		s[num[j]]-=s[num[j]/pri[i]]-i+1;
	for(int i=1;i<=cntnum;++i) s[num[i]]*=3;
	write(sieve(n,0)+1);
    }
    return 0;
}

//~kawaii~