#include<bits/stdc++.h>
#define IL inline
#define reg register
#define N 2000200
#define mod 998244353
#define int long long
IL int Add(reg int x,reg int y){return x+y<mod?x+y:x+y-mod;}
IL int Sub(reg int x,reg int y){return x<y?x-y+mod:x-y;}
IL void Pls(reg int &x,reg int y){x=Add(x,y);}
IL void Dec(reg int &x,reg int y){x=Sub(x,y);}
IL int Mul(reg int x,reg int y){reg long long r=1ll*x*y; return r<mod?r:r%mod;}
IL int power(reg int x,reg int p){reg int r=1; for(;p;p>>=1,x=Mul(x,x))if(p&1)r=Mul(r,x); return r;}

int pri[N],mu[N],tot;
bool isp[N];

IL void sieve(reg int n)
{
    mu[1]=1;
    for(reg int i=2,j,v;i<=n;++i)
    {
        if(!isp[i])mu[pri[++tot]=i]=mod-1;
        for(j=1;j<=tot&&(v=i*pri[j])<=n;++j)
        {
            isp[v]=1;
            if(i%pri[j])mu[v]=Sub(0,mu[i]);
            else break;
        }
    }
}

const int B=2e6;
int n,w[N],id1[N],id2[N],cnt;

int F(reg int n);
int G(reg int n);
int H(reg int n);

bool visf[N],vish[N],visg[N];
int f[N],g[N],h[N];

IL int ID(reg int x){return x<=B?id1[x]:id2[n/x];}

bool vis1[N],vis2[N];
int s1[N],s2[N],pw[N];

IL int S1(reg int n)
{
    reg int id=ID(n);
    if(vis1[id])return s1[id];
    vis1[id]=1;
    if(n&1)s1[id]=Mul(2,Sub(power(2,n/2),1));
    else s1[id]=Add(power(2,n/2-1),Mul(2,Sub(power(2,n/2-1),1)));
    return s1[id]=Sub(s1[id],(n-1)%mod);
}

int smu[N],sf[N],sg[N],sh[N];

int S2(reg int n)
{
    if(n<=B)return smu[n];
    reg int id=ID(n);
    if(vis2[id])return s2[id];
    vis2[id]=1;
    reg int &ans=s2[id];
    ans=1;
    for(reg int l=2,r,d;l<=n;l=r+1)
        d=n/l,r=n/d,Dec(ans,Mul((r-l+1)%mod,S2(d)));
    return ans;
}

int F(reg int n)
{
    if(n<=B)return sf[n];
    reg int id=ID(n);
    if(visf[id])return f[id];
    visf[id]=1;
    reg int &ans=f[id];
    for(reg int l=2,r,d;l<=n;l=r+1)
        d=n/l,r=n/d,Pls(ans,Add(Mul(G(d),Sub(S1(r),S1(l-1))),Mul((r-l+1)%mod,H(d))));
    return ans;
}

int G(reg int n)
{
    if(n<=B)return sg[n];
    reg int id=ID(n);
    if(visg[id])return g[id];
    visg[id]=1;
    reg int &ans=g[id]; ans=Mul(2,H(n));
    Pls(ans,Add(Mul(2,F(n)),power(2,n)-1));
    return ans;
}

int H(reg int n)
{
    if(n<=B)return sh[n];
    reg int id=ID(n);
    if(vish[id])return h[id];
    vish[id]=1;
    reg int &ans=h[id];
    for(reg int l=1,r,d;l<=n;l=r+1)
    {
        d=n/l,r=n/d;
        Pls(ans,Mul(Sub(S2(r),S2(l-1)),Sub(Mul(3,Add(F(d),pw[ID(d)])),2)));
    }
    Dec(ans,Add(Mul(2,F(n)),power(2,n)-1));
    return ans;
}

int pw2[N];

main()
{
    scanf("%lld",&n),sieve(B),pw2[0]=1;
    for(reg int i=1;i<=B;++i)pw2[i]=Mul(pw2[i-1],2);
    for(reg int d=1,t;d<=B;++d)
    {
        if(d!=1)for(t=1;d*t<=B;++t)
        {
            Pls(sg[d*t],Mul(Mul(6,mu[t]),Add(sf[d],pw2[d-2])));
            Pls(sh[d*t],Mul(Mul(3,mu[t]),Add(sf[d],pw2[d-2])));
        }
        Pls(sg[d],Sub(Mul(2,mu[d]),Add(Mul(2,sf[d]),pw2[d-1])));
        Pls(sh[d],Sub(mu[d],Add(Mul(2,sf[d]),pw2[d-1])));
        for(t=2;d*t<=B;++t)Pls(sf[d*t],Add(Mul(pw2[t/2-1]-1,sg[d]),sh[d]));
    }
    for(reg int i=1;i<=B;++i)
        Pls(sf[i],sf[i-1]),
        Pls(sg[i],sg[i-1]),
        Pls(sh[i],sh[i-1]),
        smu[i]=Add(mu[i],smu[i-1]);
    for(reg int l=1,r,x;l<=n;l=r+1)
    {
        x=n/l,r=n/x,w[++cnt]=x;
        if(x<=B)id1[x]=cnt;
        else id2[n/x]=cnt;
        pw[cnt]=power(2,x-1);
    }
    printf("%lld\n",Add(F(n),power(2,n-1)));
}