#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<bool>prime(n + 1, true);
	prime[0] = false;
	prime[1] = false;
	vector<mint>prod;
	int maxe = 0;
	rep2(i, 2, n + 1) {
		if (!prime[i])continue;
		long long ci = i;
		int e = 0;// N!がprime[i]で何回割れるか
		while (n >= ci) {
			e += n / ci;
			ci *= i;
		}
		if (2 == i) {
			prod.resize(e + 1, 1);
			maxe = e;
		}
		rep2(j, 1, e + 1) {
			prod[j] *= e / j + 1;
		}
		for (int j = i * 2; j <= n; j += i) {
			prime[j] = false;
		}
	}
	mint ans = 0;
	rep2(i, 1, prod.size())ans += prod[i];
	ans -= maxe;
	cout << ans.val() << endl;
	return 0;
}