#include<bits/stdc++.h>
using namespace std;

//#define ONLINE
#ifndef ONLINE
#define debug(...) fprintf(stderr,##__VA_ARGS__)
#else
#define debug(...) ;
#endif

using LL=long long;
using PII=pair<int,int>;

template<typename T>
inline T READ(){
	T x=0; bool f=0; char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=x*10+c-'0',c=getchar();
	return f?-x:x;
}
inline int read(){return READ<int>();}
inline LL readLL(){return READ<LL>();}
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

const int mod=998244353;
LL ksm(LL a,LL b){
	a%=mod; LL ret=1;
	while(b){
		if(b&1) ret=ret*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return ret;
}

namespace Fac{//factorial
	vector<LL>fc;
	void init(int N){
		fc.resize(N);
		fc[0]=1;
		for(int i=1;i<N;i++){
			fc[i]=fc[i-1]*i%mod;
		}
	}
	LL F(const int& x){
		return fc[x];
	}
	LL P(const int& x,const int& y){
		if(y>x) return 0;
		return fc[x]*ksm(fc[x-y],mod-2)%mod;
	}
}

int main(){
	int n=read(); LL ans=0;
	Fac::init(n+1);
	for(int i=1;i<=n;i++){
		ans=(ans+(Fac::P(n-i,i-1)*Fac::F(n-i)%mod))%mod;
	}
	printf("%lld",ans);
	return 0;
}

/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
*/