#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ep emplace_back
#define fi first
#define se second
using ll=long long;
using ull=unsigned long long;
#define pi pair<int, int>
#define pll pair<long long,long long>
#ifdef LOCAL
#include"D:/Administrator/Documents/vscode/algo/debug.h"
#else
#define debug(...) 42
#endif
ll mod=998244353;
mt19937 mrand(random_device{}());
//模板区域~~~~~~~
ll qpow(ll a,ll b){
		ll ans=1;
		while(b)
		{
			if(b&1)
			{
				(ans*=a)%=mod;
			}
			b>>=1;
			(a*=a)%=mod;
		}
		return ans;
	};
//模板结束~~~~~~~

signed main(){
#ifndef LOCAL
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#endif
#ifdef LOCAL
	freopen("D:/Administrator/Documents/vscode/in.txt","r",stdin);
	freopen("D:/Administrator/Documents/vscode/out.txt","w",stdout);
#endif
	int n;
	cin>>n;
	
	vector<ll> fact(n+1),s(n+1),inv(n+1),ans(n+1);
	fact[0]=1;s[0]=1;
	for(ll i=1;i<=n;i++)
	{
		(fact[i]=fact[i-1]*i%mod)%=mod;
		s[i]=s[i-1]*fact[i]%mod;
	}
	ll tmp=qpow(s[n],mod-2);
	for(int i=n;i>=1;i--){
		inv[i]=tmp*s[i-1]%mod;
		tmp=tmp*fact[i]%mod;
	}
	for(int i=n;i>=1;i--){
		if(i>n/2){
			ans[i]=0;
		}else{
			ans[i]=(ans[i+1]+(fact[n-i]*fact[n-i]%mod)*(inv[n-2*i+1])%mod)%mod;
		}
	}
	if(n&1) ans[1]+=1;
	cout<<ans[1];
	return 0;
}