//#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;

using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	int N;
	cin >> N;

	const int mod = 998244353;

	int A[1000001] = {};
	rep1(i, 1000000) A[i] = 1;
	for (int i = 2; i <= 1000000; i++) if (A[i] == 1) {
		for (int j = i + i; j <= 1000000; j += i) {
			A[j] = i;
		}
	}
	int B[1000001] = {};
	int mada = 1;
	for (int i = N; i >= 2; i--) {
		if (A[i] == 1 && mada) {
			mada = 0;
			continue;
		}
		map<int, int> MP;
		int tmp = i;
		while (A[tmp] != 1) {
			MP[A[tmp]]++;
			tmp /= A[tmp];
		}
		if (tmp != 1) MP[tmp]++;
		for (auto p : MP) chmax(B[p.first], p.second);
	}
	ll kotae = 1;
	rep1(i, 1000000) {
		rep(j, B[i]) kotae = kotae * i % mod;
	}
	co(kotae);

	Would you please return 0;
}