#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>

using namespace std;

namespace yjf{
	const int N=1000010;
	const int Mod=998244353;
	
	int f[N];
	int sum[N];
	
	int main(){
		//int t=-1;
		//int t2=1;
		//cout<<(t2<<t)<<endl;
		
		int n;
		scanf("%d",&n);
		
		f[0]=1;
		sum[0]=1;
		for(int i=1;i<=n;i++){
			f[i]+=sum[i-1];
			f[i]%=Mod;
			
			/*
			for(int j=0;j<i;j++){
				if((i^j)<j){
					f[i]-=f[i^j];
					f[i]=(f[i]%Mod+Mod)%Mod;
				}
			}
			*/
			
			int j;
			for(j=20;j>=0;j--){
				if((i>>j)&1){
					j--;
					break;
				}
			}
			
			for(;j>=0;j--){
				
				if((i>>j)&1){
					//cout<<"!!!"<<tmp<<" "<<(j-1)<<" "<<((tmp+1)<<j)<<" "<<(1<<(j-1))<<" "<<((tmp+1)<<j)-1<<endl;
					
					//if((1<<j)-1>=0){
						f[i]-=((sum[(1<<j)+(1<<j)-1]-sum[(1<<j)-1])%Mod+Mod)%Mod;
					//}
					//else{
					//	f[i]-=((sum[(1<<j)+(1<<j)-1])%Mod+Mod)%Mod;
					//}
					f[i]=(f[i]%Mod+Mod)%Mod;
				}
			}
			
			sum[i]=(sum[i-1]+f[i])%Mod;
			//cout<<f[i]<<endl;
		}
		
		printf("%d\n",((sum[n]-sum[0])%Mod+Mod)%Mod);
		
		return 0;
	}
}

int main(){
	//freopen("xor.in","r",stdin);
	//freopen("xor.out","w",stdout);
	
	return yjf::main();
}