#include <bits/stdc++.h>
#define Fst first
#define Snd second
#define MP make_pair
#define ll long long
#define PII pair<int,int>
#define PIL pair<int,ll>
#define PLI pair<ll,int>
#define PLL pair<ll,ll>
#define PDD pair<double,double>
using namespace std;
int n;
ll md=998244353,al=1;
ll d[1000010][2],pre[30][2],prea[2];
int fs[1000010];
int main()
{
    scanf("%d",&n); int it=0;
    for (int i=1;i<=n;i++)
    {
        fs[i]=20;
        while (!(i&(1<<fs[i]))) fs[i]--;
    }
    for (int i=1;i<=n;i++)
    {
        al=(al*2)%md;
        for (int j=0;j<2;j++)
        {
            if (!j) d[i][j]=(d[i][j]+1)%md;
            d[i][j]=(d[i][j]+prea[j])%md;
            for (int k=0;k<20;k++) if (i&(1<<k)) d[i][j]=(d[i][j]+pre[k][j^1])%md;
            //cerr <<i<<" "<<j<<" "<<d[i][j]<<" d\n";
        }
        while (it<=i && fs[it]<fs[i])
        {
            for (int j=0;j<2;j++) pre[fs[it]][j]=(pre[fs[it]][j]+d[it][j])%md;
            it++;
        }
        for (int j=0;j<2;j++) prea[j]=(prea[j]+d[i][j])%md;
    }
    printf("%lld\n",(prea[0]-prea[1]+md)%md); return 0;
}