#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)

template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

struct io_setup {
	io_setup() {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);
		cout << fixed << setprecision(15);
	}
} io_setup;

using mint = atcoder::modint998244353;
using i128 = __int128_t;

void solve() {
	ll p;
	cin >> p;
	ll ans = 1;
	ll f = 1;
	for (ll i = p - 1; i > 0; i--) {
		f = f * i % p;
		ans = (ans + f) % p;
	}
	ans = ans * atcoder::pow_mod(f, p - 2, p) % p;
	cout << ans << '\n';
}

int main() {
	int t = 1;
	// cin >> t;
	while (t--) solve();
}