#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int N = 1e7 + 7;

const ll P = 998244353;

ll fac[N];

ll qkm(ll a,ll b){
	ll res = 1;

	while (b){
		if (b & 1) res = res * a % P;
		a = a * a % P;
		b >>= 1;
	}

	return res;
}

int n;

ll A(int x,int y){
	if (y > x) return 0;
	return fac[x] * qkm(fac[x - y],P - 2) %  P;
}

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

    cin >> n;

    ll ans = 0;

    fac[0] = 1;
    for (int i = 1;i <= n;i++){
        fac[i] = fac[i - 1] * i % P;
    }
    ans = fac[n];
    for (int x = 1;x <= n;x++){
    	ans = ( ans - A(n-x,x-1) * fac[n-x] % P + P )% P; 
    }

    cout << ((fac[n] - ans) % P + P) % P;

    return 0;
}