#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define dd double
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define pii pair<int, int>
#define Mod 998244353
int power(int x,int y){
	if(y==0)return 1;
	int sum=power(x,y>>1);
	if(y&1)return sum*sum%Mod*x%Mod;
	  else return sum*sum%Mod;
}
const int N=1e7+10;
int n,fac[N],inv[N];
void solve()
{
	int ans=0;cin>>n;
	fac[0]=1;
	for(int i=1;i<=n;i++)
	  fac[i]=fac[i-1]*i%Mod;
	inv[n]=power(fac[n],Mod-2);
	for(int i=n-1;i>=0;i--)
	  inv[i]=inv[i+1]*(i+1)%Mod;
	for(int i=1;i<=(n+1)/2;i++){
		ans=(ans+fac[n-i]*fac[n-i]%Mod*inv[n-2*i+1]%Mod)%Mod;
	}
	cout << ans << endl;
}

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int _ = 1;
	while (_--)
		solve();
    return 0;
}