#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define all(a) begin(a),end(a)

const int N=1000010,MOD=998244353;
const char en='\n';
const ll LLINF=1ll<<60;

void ad(int&a,int b)
{
	a+=b;
	if (a>=MOD) a-=MOD;
}

int add(int a,int b)
{
	if (a+b>=MOD) return a+b-MOD;
	return a+b;
}

int mul(int a,int b)
{
	return a*1ll*b%MOD;
}

int pot(int n,int k)
{
	if (k==0) return 1;
	int r=pot(n,k/2);
	r=mul(r,r);
	if (k%2) r=mul(r,n);
	return r;
}

int n,fac[N],inf[N];

int cho(int a,int b)
{
	if (b<0 || b>a) return 0;
	return mul(fac[a],mul(inf[b],inf[a-b]));
}

int invcho(int a,int b)
{
	if (b<0 || b>a) return 0;
	return mul(inf[a],mul(fac[b],fac[a-b]));
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin>>n;
	fac[0]=1;
	for (int i=1;i<=n;++i) fac[i]=mul(fac[i-1],i);
	inf[n]=pot(fac[n],MOD-2);
	for (int i=n-1;i>=0;--i) inf[i]=mul(inf[i+1],i+1);
	int an=0;
	for (int p=0;p<n;++p)
	{
		ad(an,mul(cho(n-1-p,p),invcho(n-1,p)));
	}
	cout<<mul(an,fac[n-1])<<en;
}