#include<bits/stdc++.h>
#include<sstream>
#include<cassert>
#define fi first
#define se second
#define i128 __int128
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> PII;
const double eps=1e-7;
const int N=5e5+7 ,M=5e5+7, INF=0x3f3f3f3f,mod=1e9+7,mod1=998244353;
const long long int llINF=0x3f3f3f3f3f3f3f3f;
inline ll read() {ll x=0,f=1;char c=getchar();while(c<'0'||c>'9') {if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') {x=(ll)x*10+c-'0';c=getchar();} return x*f;}
inline void write(ll x) {if(x < 0) {putchar('-'); x = -x;}if(x >= 10) write(x / 10);putchar(x % 10 + '0');}
inline void write(ll x,char ch) {write(x);putchar(ch);}
void stin() {freopen("in_put.txt","r",stdin);freopen("my_out_put.txt","w",stdout);}
bool cmp0(int a,int b) {return a>b;}
template<typename T> T gcd(T a,T b) {return b==0?a:gcd(b,a%b);}
template<typename T> T lcm(T a,T b) {return a*b/gcd(a,b);}
void hack() {printf("\n----------------------------------\n");}
const int F=1e7+7;

int T,hackT;
int n,m,k;

struct Cab{
	int A[F];
	
	void init() {
		A[0]=1;
		for(int i=1;i<=10000000;i++) A[i]=(ll)A[i-1]*i%mod1;
	}
	
	int qmi(int a,int b,int mod) {
		int res=1%mod;
		while(b) {
			if(b&1) res=(ll)res*a%mod1;
			a=(ll)a*a%mod1;
			b=b>>1;
		}
		return res;
	}
	
	int C(int a,int b) {
		if(a<b) return 0;
		int res=(ll)A[b]*A[a-b]%mod1;
		return ((ll)A[a]*qmi(res,mod1-2,mod1))%mod1;
	}
};

Cab C;

void solve() {
	n=read();
	
	C.init();
	
	int res=0;
	for(int i=1;i<=n;i++) {
		int temp=(ll)C.A[i-1]*C.A[n-i]%mod1;
		res=(res+(ll)C.C(n-i,i-1)*temp%mod1)%mod1;
	}
	
	printf("%d\n",res);
}   

int main() {
    // init();
    // stin();
	// ios::sync_with_stdio(false); 

    // scanf("%d",&T);
    T=1; 
    while(T--) hackT++,solve();
    
    return 0;       
}