# [杜教筛 约数和前缀和] 51Nod 1220 约数之和

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include <tr1/unordered_map>
typedef long long ll;
using namespace std;
using namespace std::tr1;

const int P=1000000007;
const int inv2=(P+1)/2;
const int inv3=(P+1)/3;
const int maxn=1000000;

int prime[2000000],num;
int miu[maxn+5];
ll sumd[maxn+5],t1[maxn+5],t2[maxn+5]; int d[maxn+5];

inline void Pre(){
miu[1]=1; sumd[1]=1;
for (int i=2;i<=maxn;i++){
if (!d[i]) d[i]=prime[++num]=i,sumd[i]=1+i,t1[i]=1+i,t2[i]=i,miu[i]=-1;
for (int j=1;j<=num && (ll)i*prime[j]<=maxn;j++){
d[i*prime[j]]=prime[j]; int k=i*prime[j];
if (i%prime[j]==0){
miu[k]=0;
t2[k]=t2[i]*prime[j],t1[k]=t1[i]+t2[k],sumd[k]=sumd[i]/t1[i]*t1[k];
break;
}
miu[i*prime[j]]=miu[i]*miu[prime[j]];
sumd[k]=sumd[i]*sumd[prime[j]],t1[k]=1+prime[j],t2[k]=prime[j];
}
}
for (int i=1;i<=maxn;i++)
miu[i]=((ll)i*((P+miu[i])%P)%P+miu[i-1])%P,(sumd[i]+=sumd[i-1])%=P;
}

unordered_map<ll,int> S;

x+=y; if (x>=P) x-=P;
}

inline int sum1(ll n){ return (n+1)%P*(n%P)%P*inv2%P;}
inline int sum1(ll l,ll r){ return (l+r)%P*((r-l+1)%P)%P*inv2%P; }

inline int Sum(ll n){
if (n<=maxn) return miu[n];
if (S.find(n)!=S.end()) return S[n];
int tem=1; ll l,r;
for (ll t=n/l;l<=n;l=r+1,t--)
return S[n]=tem;
}
/*
inline int F(ll n){
int t1=0,t2=0; ll l,r;
for (ll t=n/l;l<=n;l=r+1,t--)
return (ll)t1*t2%P;
}
*/

inline int F(ll n){
if (n<=maxn) return (ll)sumd[n]*sumd[n]%P;
int t1=0; ll l,r;
for (ll t=n/l;l<=n;l=r+1,t--)
return (ll)t1*t1%P;
}

int main(){
ll n,l,r; int Ans=0;
freopen("t.in","r",stdin);
freopen("t.out","w",stdout);
Pre();
scanf("%lld",&n);
for (ll t=n/l;l<=n;l=r+1,t--)
printf("%d\n",Ans);
return 0;
}