#include<bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3f
#define FIN freopen("input.txt","r",stdin)
#define mem(x,y) memset(x,y,sizeof(x))
typedef unsigned long long ULL;
typedef long long LL;
#define fuck(x) cout<<"["<<x<<"]"<<endl;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
typedef pair<pair<int,int>,int> PIII;
typedef pair<int,int> PII;
const double eps=1e-6;
const int MX=1e5+5;
const int P=1000000007;
int n;
int prime[MX];
bool isprime[MX];
void init()
{
mem(isprime,1);
prime[0]=0;
for(int i=2; i<MX; i++)
{
if(isprime[i])
{
prime[++prime[0]]=i;
}
for(int j=1; j<=prime[0]&&i*prime[j]<MX; j++)
{
isprime[i*prime[j]]=0;
if(i%prime[j]==0)break;
}
}
}
int cal(int x)
{
int xx=x;
int phi=x;
for(int i=1; i<=prime[0]&&x!=1; i++)
{
if(x%prime[i]==0)
{
phi=(LL)phi*(prime[i]-1)/prime[i];
while(x%prime[i]==0)x/=prime[i];
}
}
if(x!=1)
phi=(LL)phi*(x-1)/x;
return (LL)phi*(n/xx)%P;
}
int main()
{
FIN;
init();
int t;
cin>>t;
while(t--)
{
cin>>n;
int ans=(LL)n*(1+n)/2%P;
for(int i=1; i<=232; i++)
{
ans=(ans-cal(i)+P)%P;
}
for(int i=n; i>n-233; i--)
{
ans=(ans-cal(i)+P)%P;
}
cout<<ans<<endl;
}
return 0;
}