//qoj8635
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int N = 5010;
const ll P = 998244353;
int n;
ll f[N][N], ans, fac[N];

ll qp(ll x, ll y){
	ll ans = 1;
	while(y){
		if(y & 1){
			ans = ans * x % P;
		}
		x = x * x % P;
		y >>= 1;
	}
	return ans;
}

int main(){
	scanf("%d", &n);
	if(n <= 3){
		puts("1");
		return 0;
	}
	f[1][1] = fac[1] = 1;
	for(int i = 2; i <= n; ++ i){
		fac[i] = fac[i-1] * i % P;
		for(int j = 1; j <= n; ++ j){
			f[i][j] = (f[i-1][j-1] + f[i-2][j-1]) % P;
			if(i > 3) f[i][j] = (f[i][j] + f[i-3][j-1]) % P;
		}
	}
	for(int i = 1; i <= n; ++ i){
		ll tmp = (f[n-3][i-1] * 2 + f[n-4][i-1] + f[n-2][i]) % P;
		// printf("%d %d\n", i, tmp);
		ans = (ans + tmp * i % P * fac[i-1] % P * fac[n-i] % P);
	}
	printf("%lld\n", ans * qp(fac[n-1], P-2) % P);
	return 0;
}