#include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <cmath>

 #include <algorithm>

 using namespace std;

 typedef long long int64;

 const int mod=;

 #define maxn 2000005

 int top,tot,d[maxn],prim[maxn],mu[maxn];

 bool vis[maxn];

 int64 n,f[maxn],ans;

 void prepare(){

     tot=top=,memset(vis,,sizeof(vis)),mu[]=,mu[]=,f[]=;

     for (int i=;i<maxn;i++){

         if (vis[i]==){

             prim[++top]=i;

             d[i]=i;

             mu[i]=-;

             f[i]=;

         }

         for (int j=;j<=top;j++){

             if (i*prim[j]>=maxn) break;

             vis[i*prim[j]]=;

             if (i%prim[j]==){

                 d[i*prim[j]]=d[i]*prim[j];

                 mu[i*prim[j]]=;

                 f[i*prim[j]]=f[i/d[i]]*(f[d[i]]+);

                 break;

             }else{

                 d[i*prim[j]]=prim[j];

                 mu[i*prim[j]]=mu[i]*mu[prim[j]];

                 f[i*prim[j]]=f[i]*f[prim[j]];

             }

         }

     }

     for (int i=;i<maxn;i++) mu[i]+=mu[i-];

     for (int i=;i<maxn;i++) f[i]=(f[i-]+f[i])%mod;

 }

 #define maxp 100007

 #define maxm 4000005

 int now[maxp],prep[maxm];

 int64 val[maxm],id[maxm];

 void insert(int x,int64 y){

     int pos=x%maxp;

     prep[++tot]=now[pos],now[pos]=tot,val[tot]=y,id[tot]=x;

 }

 int64 find(int x){

     int pos=x%maxp;

     for (int i=now[pos];i;i=prep[i]){

         if (id[i]==x) return val[i];

     }

     return -;

 }

 int64 Mu(int x){

     if (x<maxn) return mu[x];

     int64 temp=find(x),t;

     if (temp!=-) return temp;

     temp=;

     for (int j,i=;i<=x;i=j+){

         j=x/(x/i);  t=Mu(x/i);

         temp=((temp-1LL*(j-i+)*t%mod)%mod+mod)%mod;

     }

     insert(x,temp); return temp;

 }

 int64 F(int x){

     if (x<maxn) return f[x];

     int64 temp=;

     for (int j,i=;i<=x;i=j+){

         j=x/(x/i);

         temp=(temp+1LL*(x/i)*(j-i+)%mod)%mod;

     }

     return temp%mod;

 }

 int main(){

     int64 temp;

     prepare();

     scanf("%lld",&n);

     ans=;

     for (int j,i=;i<=n;i=j+){

         j=n/(n/i); temp=F(n/i);

         ans=(ans+1LL*(Mu(j)-Mu(i-))%mod*temp%mod*temp%mod)%mod;

     }

     printf("%lld\n",(ans%mod+mod)%mod);

     return ;

 }