#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

constexpr int P = 998244353;

i64 power(i64 a, i64 k) {
	i64 res = 1;
	for ( ; k; k >>= 1, a = a * a % P) {
		if (k & 1) {
			res = res * a % P;
		}
	}
	return res;
}

i64 get_inv(i64 x) {
	return power(x, P - 2);
}

void solve() {
	int n;
	cin >> n;

    vector<i64> fac(n + 1), inv_fac(n + 1);
    fac[0] = 1;
    for (int i = 1; i <= n; i++) {
        fac[i] = fac[i - 1] * i % P;
    }
    inv_fac[n] = power(fac[n], P - 2);
    for (int i = n; i; i--) {
        inv_fac[i - 1] = inv_fac[i] * i % P;
    }

	auto Perm = [&](int a, int b) -> i64 {
		if (a == b) {
			return fac[a];
		}
		if (a < b) {
			return 0;
		}
		return fac[a] * inv_fac[a - b] % P;
	};

    int ans = 0;
    for (int i = 1; i <= n; ++ i) {
    	ans += Perm(n - i, i - 1) * Perm(n - i, n - i) % P;
    	ans %= P;
    }
    cout << ans << "\n";
}	

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	solve();

	return 0;
}