#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long x[1000010];
int main() {
	long long n, no;
	long long mod = 998244353;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		x[i] = 1;
	}
	for (int i = n; i > 0; i--) {
		bool bo = true;
		for (int j = 2; j * j <= n; j++) {
			if (i % j == 0) {
				bo = false;
			}
		}
		if (bo) {
			no = i;
			break;
		}
	}
	long long ans = 1;
	for (int i = 2; i <= n; i++) {
		if (i != no) {
			long long now = i / x[i];
			ans *= now;
			for (int j = i + i; j <= n; j += i) {
				x[j] *= now;
			}
			ans %= mod;
		}
	}
	cout << ans << endl;
}