#include<bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pf push_front
#define LC k<<1
#define RC k<<1|1
#define IO cin.sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repn(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = (n) - 1; i >= a; i--)
#define pern(i, a, n) for (int i = n; i >= a; i--)

typedef long long LL;
typedef long double LD;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, LL> PIL;
typedef pair<LL, int> PLI;
typedef pair<double, double> PDD;
typedef pair<ull, ull> PUU;
typedef pair<LL, LL> PLL;

const int N = 110000;
const int M = 1100000;
const int mod = 998244353;
const int inf = (int)1e9;
const LL INF = 1e18;
const double eps = 1e-9;

mt19937_64 Rand((unsigned long long)new char);
#define rand Rand

int n, lim;
int f[N], g[N];
const int L = 20210926;
int dfs(LL x) {
	if (x > n) return 0;
	if (x > 50) x = n / (n / x);
	if (x <= lim && f[x]) return f[x];
	else if (x > lim && g[n / x]) return g[n / x];
	int res = 1, l = 2, r, d = n / x;
	while ((LL)l * x <= 50) res = (res + dfs(l * x)) % mod, l++;
	d = min(d, L);
	while (l <= d) {
		r = min((LL)d, n / (n / (l * x)) / x);
		LL num = (r - l + 1) % mod;
		num = num * dfs(l * x) % mod;
		res = (res + num) % mod;
		l = r + 1;
	}
	if (x <= lim) return f[x] = res;
	else return g[n / x] = res;
}
int main() {
	IO;
	cin >> n;
	// n = 1000000000;
	lim = int(sqrt(n) + 0.1);
	cout << dfs(1) << "\n";
	return 0;
}