#include <bits/stdc++.h>

using namespace std;

#define int long long
using i64 = long long;

typedef pair<int, int> PII;
typedef pair<int, char> PIC;
typedef pair<double, double> PDD;
typedef pair<int, PII> PIII;
typedef pair<int, pair<int, bool>> PIIB;

// const int N = 1e5 + 10;
const int maxn = 1e6 + 10;
// const int mod = 998244353;
const int mod1 = 954169327;
const int mod2 = 906097321;
const int INF = 0x3f3f3f3f3f3f3f3f;
const int N = 1e7 + 10 , mod = 998244353;
int f[N] , n;

int inv[N];

int ksm(int a , int b){
	int res = 1;
	while(b){
		if(b & 1)res = res * a % mod;
		b >>= 1;
		a = a * a % mod;
	}
	return res;
}

void get_inv(){
	int p=mod;
	inv[1] = 1;
	for (int i = 2; i <= 10000000; ++i) {
	inv[i] = (long long)(p - p / i) * inv[p % i] % p;
	}
}




int C(int a , int b){
	 if(a < b)return 0;
	 return (((f[a] * ksm(f[b] , mod - 2) % mod + mod) % mod) * inv[f[a - b]] % mod + mod) % mod;

}



void solve()
{
	cin >> n;
	f[0] = 1;inv[0] = 1;
	for(int i = 1 ; i <= n; i  ++){
		f[i] = f[i - 1] * i % mod;
		// inv[i] = ksm(f[i] , mod - 2);
	}
	int ans = 0;
	for(int i = 1 ; i <= n ; i ++){
		if(n - 2 * i + 1 >= 0)
			ans = (ans + (f[n - i] * ksm(f[n - 2 * i + 1] , mod - 2) % mod) * f[n - i] % mod) % mod;
	}
	cout << ans << '\n';
	return;
}

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	// get_inv();
	int t = 1;
	// cin >> t;
	while (t--)
	{
		solve();
	}
}