#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define ott(i, l, r) for (int i = (l); i <= (r); i ++)
#define tto(i, l, r) for (int i = (r); i >= (l); i --)
#define fi first
#define se second 
#define pb push_back
#define all(x) x.begin (), x.end ()
typedef double db;
typedef long long ll;
typedef long double ld;
int read () {
	int x = 0; bool f = false; char c = getchar ();
	while (!isdigit (c)) f |= (c == '-'), c = getchar ();
	while (isdigit (c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar ();
	return f ? -x : x;
}
const int N = 1e6 + 110;
int n, mod;
int f[N], s[N];
int main () {
	n = read (), mod = 998244353;
	s[1] = f[1] = 1;
	ott (i, 2, n) {
		f[i] = (s[i - 1] + 1) % mod;
		int j = 20; while (!(i >> j & 1)) -- j;
		tto (k, 0, j - 1) if (i >> k & 1) (f[i] += (s[(1 << k) - 1] + mod - s[(1 << k + 1) - 1]) % mod) %= mod;
		s[i] = (s[i - 1] + f[i]) % mod;
	}
	printf ("%d\n", s[n]);
	return 0;
}