#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001
struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};


vector<mint> a(100005);
combi C(500000);
void dfs(int l,int r){
	if(r-l<=1)return;
	int m = (l+r)/2;
	dfs(l,m);
	vector<mint> x(m-l);
	rep(i,m-l)x[i] = a[l+i];
	vector<mint> y(r-l);
	rep(i,r-l){
		y[i] = -C.kaijou[i+1];
	}
	x = convolution(x,y);
	for(int i=m;i<r;i++){
		a[i] += x[i-l];
	}
	dfs(m,r);
	
}

int main(){
	
	
	int n;
	cin>>n;
	for(int i=1;i<n;i++){
		a[i] = C.kaijou[i+1];
	}
	dfs(1,n);
	mint ans = 0;
	rep(i,n)ans += a[i];
	
	cout<<ans.val()<<endl;
	/*
	vector<mint> a(n+1,0);
	for(int i=1;i<n;i++){
		a[i] = C.kaijou[i+1];
		for(int j=1;j<i;j++){
			a[i] -= a[j] * C.kaijou[i-j+1];
		}
		
		cout<<a[i].val()<<endl;
		ans += a[i];
	}
	*/
	
	return 0;
}