#include <bits/stdc++.h>

using namespace std;
#define int long long
#define rep(i, l, r) for(int i = l; i <= (int)r; i ++)
#define debug(a) cout << #a << " = " << a << '\n';
#define debug2(a, b) cout << #a << " = " << a << "  " << #b << " = " << b << '\n';
const int N = 1e7 + 3, mod = 998244353;


int n;
const int p = 998244353;
namespace CNM {
    const int N = 1e7 + 4;
    int fac[N], infac[N];
    int ksm(int x, int y) {
        int res = 1;
        while(y > 0) {
            if(y & 1)
                res = res * x % p;
            y >>= 1;
            x = x * x % p;
        }
        return res;
    }
    void init() {
        fac[0] = 1;
        for(int i = 1; i < N; i ++)
            fac[i] = fac[i - 1] * i % p;
        infac[N - 1] = ksm(fac[N - 1], p - 2);
        for(int i = N - 2; i >= 0; i --)
            infac[i] = infac[i + 1] * (i + 1) % p;
    }
    int C(int n, int m) {
        if(n < m || m < 0) return 0;
        return (fac[n] * infac[m] % p) * infac[n - m] % p;
    }
    int A(int n, int m) {
    	if(n < m || m < 0) return 0;
    	return fac[n] * infac[n - m] % mod;
    }
}
int A(int n, int m) {
	return CNM::A(n, m);
}
void solve() {
	cin >> n;

	CNM::init();

	int ans = 0;
	for(int i = 1; i <= n; i ++) {
		ans += A(n - i, i - 1) * A(n - i, n - i) % mod;
		ans %= mod;
	}
	cout << ans << '\n';
}
main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int _ = 1;
    // cin >> _;
    while(_ --) {
    	solve();
    }
    return 0;
}