#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e6 + 10;
const int mod = 998244353;
int n, m, k;
string s1, s2;
int h[N], idx, ne[N];
vector<int> pa;
double a, b;

int axy(int x, int y) {
	int ans = 1;

	for (int i = 0; i < x; i++) {
		ans =(ans*(y-i)%mod)%mod;
	}
	if(x==0) return 1; 
	return ans;
}

void solve() {
	scanf("%lld",&n);
	int ans = 0;
	for (int i = 1; i <= n+1; i++) {
		
		if (n - i >= i - 1) {
			
			int t1=axy(n-i,n-i)%mod;
			int t2=axy(i-1,n-i)%mod;
			ans+=(t1*t2)%mod;
			ans%=mod;
			
		}
		
	}

//	cout<<axy(3,3)<<endl;
	cout << ans << endl;

}


signed main() {
	int t = 1;
	//cin >> t;
	while (t--) {
		solve();
	}
}