#include<bits/stdc++.h>
#define maxn 1000050
#define modu 1000000007
using namespace std;
typedef long long LL;

bool noprime[maxn];
int p[maxn],pnum;

LL mu[maxn],sum[maxn];

void predo()    {
    mu[1]=1;
    for (int i=2;i<maxn;++i)    {
        if (!noprime[i])    {
            p[++pnum]=i;
            mu[i]=modu-1;
        }
        for (int j=1;j<=pnum&&i*p[j]<maxn;++j)   {
            noprime[i*p[j]]=1;
            if (i%p[j]==0)  
                break;
            mu[i*p[j]]=modu-mu[i];
        }
    }

    for (int i=1;i<maxn;++i)
        sum[i]=(sum[i-1]+mu[i]*i)%modu;
}

LL sqrt(LL n)   {
    LL l=1,r=1e9;
    while (l<r) {
        LL mid=(l+r+1)>>1;
        if (mid*mid<=n)
            l=mid;
        else
            r=mid-1;
    }
    return l;
}

LL n;


LL S1(LL x) {
    x%=modu;
    return x*(x+1)/2%modu;
}

LL calc(LL n)   {
    LL ans=0;
    for (LL i=1,j,t;i<=n;i=j+1) {
        j=n/(t=n/i);
        ans+=(S1(j)-S1(i-1)+modu)%modu*(t%modu)%modu;
        ans%=modu;
    }
    return ans;
}

int main()  {
    predo();

    int T;
    scanf("%d",&T);
    while (T--) {
        scanf("%lld",&n);

        LL ans=0;
        // for (int k=1;k<=n;++k)  {
        //     LL res=0;
        //     for (int d=1;d*k<=n;++d)
        //         res+=k*d*(n/(k*k*d));
        //     LL tmp=calc(n/(k*k))*k%modu%modu;
        //     cout<<res<<" "<<tmp<<endl;
        //     assert(res==tmp);
        //     ans=(ans+res*mu[k])%modu;
        // }

        for (LL i=1,j,t;i*i<=n;i=j+1) {
            t=n/(i*i);
            j=sqrt(n/t);
            ans=(ans+(sum[j]-sum[i-1]+modu)*calc(t))%modu;
        }
        printf("%lld\n",ans);
    }
    return 0;
}