#include<iostream>
using namespace std;
int n,a[1000001]={0,1,2,3,3,4,4,4,4,5,5};
int ans=0;
int main()
{
	cin>>n;
	for(int i=11;i<=n;i++)
	{
		if(i%2)
		{
			a[i]=a[i/2+1]+1;
		}
		else
		{
			a[i]=a[i/2]+1;
		}
	}
	for(int i=1;i<=n;i++)
	{
		ans+=a[i]%998244353;
	}
	cout<<ans % 998244353<<endl;
	return 0;
 }

$O(n)$的算法过不了啊QWQ