#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)

ll modpow(ll a, ll n, ll m) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * a % m;
		a = a * a % m;
		n >>= 1;
	}
	return res;
}

int main() {
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	
	ll P;
	cin >> P;
	
	ll frac = 1;
	rep(i, 2, P) frac = (frac * (ll)i) % P;
	frac = modpow(frac, P - 2, P);
	
	ll ans = 0;
	for (ll t = P - 1; t >= 0; --t) {
		ans = (ans + frac) % P;
		frac = (frac * t) % P;
	}
	cout << ans << '\n';
}