#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int nn=1e7+10;
ll dp[nn];
const ll mod=998244353;
ll pow1(ll bas,ll y){
	ll ba=1;
	while(y){
		if(y&1){
			ba*=bas;
			ba%=mod;
		}
		y/=2;
		bas*=bas;
		bas%=mod;
	}
	return ba;
}
ll ji[nn];
ll inv[nn];
ll n;
void init(){
	ji[0]=1;
	for(ll i=1;i<=n;i++){
		ji[i]=ji[i-1]*i;
		ji[i]%=mod;
	}
	inv[n]=pow1(ji[n],mod-2);
	for(ll i=n-1;i>=0;i--){
		inv[i]=inv[i+1]*(i+1);
		inv[i]%=mod;
	}
}
void solve(){
	cin>>n;
	ll ans=0;
	init();
	if(n==1){
		cout<<1<<"\n";return;
	}
	for(ll i=1;i<=(n+1)/2;i++){
		ll an1=1;
		/*
		for(ll j=1;j<=i-1;j++){
			an1*=(n-i-j+1);
		}
		for(int j=1;j<=n-i;j++){
			an1*=j;
		}
		*/
		ll pos1=n-i;
		ll pos2=n-2*i+1;
		an1 *= (ji[pos1] % mod * inv[pos2] % mod) % mod;
		an1 %= mod;
		an1*=ji[pos1];
		
		an1%=mod;
		ans+=an1;
		ans%=mod;
		
	}
	cout<<ans<<"\n";
}
int main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	solve();
}