#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<map>
#include<stack>
#include<set>
#include<ctime>
#define iss ios::sync_with_stdio(false)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int,int>pii;
const int MAXN=1e6+5;
const int mod=998244353;
const int inf=0x3f3f3f3f;
ll sum[MAXN],dp[MAXN];
int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        dp[i]=sum[i-1]+1;
        int temp=i;
        int x=1;
        while(temp)
        {
            if((temp&1)&&temp!=1)
            {
                dp[i]=(mod+dp[i]-sum[min(x*2-1,i)]+sum[min(x-1,i)])%mod;
                //cout<<min(x,i-1)<<" "<<min(x*2-1,i-1)<<endl;
            }
            temp>>=1;
            x=x*2;
        }
        sum[i]=(sum[i-1]+dp[i])%mod;
    }
    printf("%lld\n",sum[n]);
}