#include <bits/stdc++.h>
#define ll long long
#define int long long
using namespace std;
template<typename T>void read(T &x)
{
    T f=1;x=0;char s=getchar();
    while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
    while(s>='0'&&s<='9') {x=x*10+s-'0';s=getchar();}
    x*=f;
}
int High[1000005],mod;
ll f[1000005],g[1000005],Sum[1000005];
int qpow(int a,int b)
{
    int ret=1;
    while(b)
    {
        if(b&1) (ret+=a)%=mod;//Mul(ret,a);
        b>>=1;a=a*a%mod;
    }
    return ret;
}
signed main() {
    int n;read(n);
   mod=998244353;
    for(int i=1;i<=n;i++)
    {
        if(i&(i-1)) High[i]=High[i-1];
        else High[i]=i;
    }//二进制下最大高度 
    ll Tmp=0;
    for(int i=1;i<=n;i++)
    {
        if(!(i&(i-1))) Tmp=0;
        f[i]=(Sum[High[i]-1]+1)*(i-High[i])%mod;//最高位小于High[i]的两个数异或和一定不等于i 
        for(int j=i^High[i];j;j^=High[j])
            f[i]-=(Sum[(High[j]<<1)-1]-Sum[High[j]-1])%mod,(f[i]+=mod)%mod;
        g[i]=(f[i]+1+Sum[High[i]-1]+Tmp)%mod;//结尾为i的方案数 
        Tmp*=2,Tmp+=f[i];
        Tmp%=mod;
        Sum[i]=(Sum[i-1]+g[i])%mod;//前缀和 
    }
    printf("%lld",Sum[n]);
    return 0;
}