#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define endl "\n"
const int N = 1e6, M = 110, mod = 998244353, inf = 2e9;
const long long D = 1e12;
typedef pair<int, int> pt;
typedef long long ll;

struct Comb {

	vector<ll> fac, inv, finv;

	Comb(int n) {
		fac.assign(n + 1, 1ll);
		finv = inv = fac;
        
		for (int i = 1; i < n; i++) fac[i] = fac[i - 1] * i % mod;
		for (int i = 2; i < n; i++) inv[i] = (mod - mod / i) * inv[mod % i] % mod;
		for (int i = 2; i < n; i++) finv[i] = finv[i - 1] * inv[i] % mod;
	}
	
	ll A(int a, int b){
        if (a < b) return 0;
		return fac[a] * finv[a - b] % mod;
	}

	ll C(int a, int b){
		if (a <= 0 || b < 0 || b > a) return 0;
		else return fac[a] * finv[a - b] % mod * finv[b] % mod;
	}
};

void solve() {
    int n;
    cin >> n;
    Comb comb(n);
    ll res = 0;
    for(int i = 1; i <= n; i++){
        res += comb.A(n - i, i - 1) * comb.fac[n - i];
        res %= mod;
    }
    cout << res << endl;
}
signed main() {
    //freopen("title.in", "r", stdin);
    //freopen("std.txt", "w", stdout);
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	int t = 1;
	//cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}