#pragma GCC optimize("Ofast,inline,unroll-loops,fast-math,no-stack-protector")
#include<bits/stdc++.h>
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
using namespace std;
using ll = int64_t;
using LL = long long;
using ull = uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using pii = pair<ll, ll>;
const int mod = 998244353;
const int N = 1e7 + 7;
const int maxn = 1e5 + 100;
template<const int T>
struct ModInt {
	const static int mod = T;
	int x;
	ModInt(int x = 0) : x(x % mod) {}
	ModInt(long long x) : x(int(x % mod)) {}
	int val() { return x; }
	ModInt operator + (const ModInt &a) const { int x0 = x + a.x; return ModInt(x0 < mod ? x0 : x0 - mod); }
	ModInt operator - (const ModInt &a) const { int x0 = x - a.x; return ModInt(x0 < 0 ? x0 + mod : x0); }
	ModInt operator * (const ModInt &a) const { return ModInt(1ll * x * a.x % mod); }
	ModInt operator / (const ModInt &a) const { return *this * a.inv(); }
	bool operator == (const ModInt &a) const { return x == a.x; };
	bool operator != (const ModInt &a) const { return x != a.x; };
	void operator += (const ModInt &a) { x += a.x; if (x >= mod) x -= mod; }
	void operator -= (const ModInt &a) { x -= a.x; if (x < 0) x += mod; }
	void operator *= (const ModInt &a) { x = 1ll * x * a.x % mod; }
	void operator /= (const ModInt &a) { *this = *this / a; }
	friend ModInt operator + (int y, const ModInt &a) { int x0 = y + a.x; return ModInt(x0 < mod ? x0 : x0 - mod); }
	friend ModInt operator - (int y, const ModInt &a) { int x0 = y - a.x; return ModInt(x0 < 0 ? x0 + mod : x0); }
	friend ModInt operator * (int y, const ModInt &a) { return ModInt(1ll * y * a.x % mod);}
	friend ModInt operator / (int y, const ModInt &a) { return ModInt(y) / a;}
	friend ostream &operator<<(ostream &os, const ModInt &a) { return os << a.x;}
	friend istream &operator>>(istream &is, ModInt &t) {return is >> t.x;}

	ModInt pow(int64_t n) const {
		ModInt res(1), mul(x);
		while (n) {
			if (n & 1) res *= mul;
			mul *= mul;
			n >>= 1;
		}
		return res;
	}

	ModInt inv() const {
		int a = x, b = mod, u = 1, v = 0;
		while (b) {
			int t = a / b;
			a -= t * b; swap(a, b);
			u -= t * v; swap(u, v);
		}
		if (u < 0) u += mod;
		return u;
	}

};
using mint = ModInt<mod>;
mint jc[N], ijc[N];
void init(int n) {
	jc[0] = 1;
	for (int i = 1; i <= n; i++) {
		jc[i] = jc[i - 1] * i;
	}
	ijc[n] = (mint)1 / jc[n];
	for(int i=n-1;i>=0;i--){
		ijc[i] = ijc[i + 1] * (i + 1);
	}
}
mint C(int n,int m){
	if(m > n)return 0;
	return jc[n]*ijc[m]*ijc[n - m];
}
void solve() {
	int n;
	cin >> n;
	init(n);
	mint ans = 0;
	for (int i = 1; i <= n; i++) {
		ans += C(n-i,i - 1) * jc[i - 1] * jc[n - i];
	}
	// ans = jc[n] - ans;
	cout << ans << '\n';
}
int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int _;
	_ = 1;
	// cin >> _;
	while (_--) {
		solve();
	}
	return 0;
}