#include <bits/stdc++.h>
#define int long long
using namespace std;
const int M=998244353;
const int N=1e7+10;
int f[N];
int fn[N];
int exgcd(int a, int b, int &x, int &y)// 拓欧
{
    if (b == 0)
    {
        x = 1;
        y = 0;
        return a;
    }
    int d = exgcd(b, a % b, y, x);
    y -= (a / b) * x;
    return d;
}
int inv(int a, int p)
{
    int x, y;
    if (exgcd(a, p, x, y) != 1) // 无解的情形
        return -1;
    return (x % p + p) % p;
}
int quick(int a,int b)
{
	int ans=1%M;
	while(b)
	{
		if(b&1)
			ans=ans*a%M;
		a=a%M*a%M;
		a%=M;
		b>>=1;
	}
	return ans%M;
}
signed main(){
	int n;
	scanf("%lld",&n);
	f[0]=f[1]=1;
	fn[0]=fn[1]=1;
	for(register int i=2;i<=n;i++)
	{
		f[i]=f[i-1]*i%M;
	}
	int ans=f[n-1]%M;
	for(register int i=2;i<=(n+1)/2;i++)
	{
	//	cout<<1;
		ans=(ans+f[n-i]*f[n-i]%M*inv(f[n-i-(i-1)],M)%M)%M;
		//cout<<i<<" ";
		ans%=M;
	}
	//cout<<'\n';
	printf("%lld",ans);
	return 0;
}