#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e7 + 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 infact[N];
int fact[N];

int qmi(int a,int k,int p)
{
	int res=1;
	while(k){
		if(k&1) res=res*a%p;
		a=a*a%p;
		k>>=1;
	}
	return res;
}


void solve() {
	cin >> n;
	fact[0]=infact[0]=1;
	for(int i=1;i<=n;i++)
	{
		fact[i]=fact[i-1]*i%mod;
		infact[i]=infact[i-1]*qmi(i,mod-2,mod)%mod;
	}
	int ans = 0;
	for (int i = 1; i <= n+1; i++) {
		
		if (n - i >= i - 1) {
			int t1=fact[n-i]%mod;
			int t2=fact[n-i]*infact[n-i-(i-1)]%mod;
			ans=(ans+(t1*t2)%mod)%mod;
		}
		
	}
	//cout<<fact[3]<<endl;
	cout << ans << endl;
}


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