#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e7 + 5;
const int INF = 998244353;

int n;
int fac[maxn], ifac[maxn];

inline int qpow(int x, int y){
	int ret = 1;
	for(; y; y >>= 1){
		if(y & 1) ret = 1ll * ret * x % INF;
		x = 1ll * x * x % INF;
	}
	return ret;
}

inline int binom(int x, int y){
	if(x > y) return 0;
	return 1ll * fac[x] * ifac[y] % INF * ifac[x - y] % INF;
}

int main(){
	scanf("%d", &n);
	fac[0] = 1; for(int i = 1; i <= n; ++i) fac[i] = 1ll * fac[i - 1] * i % INF;
	ifac[n] = qpow(fac[n], INF - 2); for(int i = n - 1; i >= 0; --i) ifac[i] = 1ll * ifac[i + 1] * (i + 1) % INF;
	int ans = 0;
	for(int i = 1; i <= n; ++i) if(n - i >= i - 1){
		int res = 1ll * fac[n - i] * ifac[(n - i) - (i - 1)] % INF * fac[n - i] % INF;
		ans = (ans + res) % INF;
	}
	printf("%d\n", ans);
	return 0;
}