#include <stdio.h>
#include <string.h>

#include <bitset>
#include <vector>
#include <algorithm>

#define LOG(FMT...) fprintf(stderr, FMT)

#define eb emplace_back

using namespace std;

typedef long long LL;
constexpr int N = 20000005;
constexpr int mod = 998244353;

char gc() {
	static char buf[1 << 21], *p1 = buf, *p2 = buf;
	return (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? -1 : *p1++);
}
int read() {
	int x = 0; char c = gc();
	while (c < 48 || c > 57) {
		c = gc();
	}
	for (; c > 47 && c < 58; c = gc()) {
		x = x * 10 + (c ^ 48);
	}
	return x;
}

int pr[N], cnt;
bool was[N];
int c[N];

void sieve() {
	for (int x = 2; x < N; ++x) {
		if (!was[x]) {
			pr[cnt++] = x;
		}
		for (int k = 0; x * pr[k] < N; ++k) {
			was[x * pr[k]] = true;
			if (!(x % pr[k])) {
				break;
			}
		}
	}
	for (int i = 2; i < N; ++i) {
		c[i] = c[i - 1] + !was[i];
	}
}

constexpr int inv(int x, int k = mod - 2) {
	int r = 1;
	while (k) {
		if (k & 1) {
			r = x * (LL)r % mod;
		}
		x = x * (LL)x % mod;
		k >>= 1;
	}
	return r;
}

constexpr int f(int x) {
	if (x == 1) {
		return 1;
	}
	if (x == 2) {
		return 1;
	}
	if (x == 3) {
		return 3;
	}
	int y = c[x] - c[x / 2];
	return (x - y - 1) * (LL)inv(x, y) % mod;
}

int main() {
	sieve();
	LL n;
	scanf("%lld", &n);
	int res = 1;
	for (LL l = 1, r; l <= n; l = r + 1) {
		r = n / (n / l);
		res = res * (LL)inv(f(n / r), r - l + 1) % mod;
	}
	printf("%d\n", res);
	return 0;
}