#include<stdio.h>
int query(long long x)
{
    x%=1000000007;
    return (long long)x*(x+1)/2%1000000007;
}
int sol(long long x)
{
    int ans=0;
    long long ii;
    for(long long i=1;i<=x;i=ii+1)
    {
        ii=x/(x/i);
        int inc=query(ii)-query(i-1);
        if(inc<0)
        {
            inc+=1000000007;
        }
        inc=(long long)inc*((x/i)%1000000007)%1000000007;
        ans+=inc;
        if(ans>=1000000007)
        {
            ans-=1000000007;
        }
    }
    return ans;
}
int p[1048576],minp[1048576],miu[1048576],cnt=0;
int main()
{
    miu[1]=1;
    for(int i=2;i<=1000000;i++)
    {
        if(!minp[i])
        {
            p[cnt]=i;
            minp[i]=i;
            miu[i]=1000000006;
            cnt++;
        }
        for(int j=0;j<cnt&&p[j]<=minp[i]&&(long long)i*p[j]<=1000000;j++)
        {
            minp[i*p[j]]=p[j];
            if(p[j]==minp[i])
            {
                miu[i*p[j]]=0;
            }
            else
            {
                miu[i*p[j]]=(long long)miu[i]*1000000006%1000000007;
            }
        }
    }
    int t;
    scanf("%d",&t);
    while(t--)
    {
        long long n;
        scanf("%lld",&n);
        int ans=0;
        for(int i=1;(long long)i*i<=n;i++)
        {
            int inc=(long long)miu[i]*sol(n/i/i)%1000000007;
            ans+=(long long)inc*i%1000000007;
            if(ans>=1000000007)
            {
                ans-=1000000007;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}