// Problem: 小红的区间删除
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/78292/G
// Memory Limit: 524288 MB
// Time Limit: 4000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using PII = pair<ll,ll>;
using VVI = vector<vector<int>>;
const ll mod = 998244353;
const ll INF = 1e18;
const int N = 1e7 + 10;
ll n,k;
ll fac[N];
ll inv[N];
ll s[N];

ll ksm(ll a , ll b , ll mod){
	ll res = 1;
	while(b){
		if(b % 2) res = res * a % mod;
		b /= 2;
		a = a * a % mod;
	}
	return res;
}

ll A(int n , int m){
	if(m > n) return 0;
	return fac[n] * inv[n - m] % mod;
}
ll calc(int i){
	return s[n - i] * ksm(s[n - i - i + 1] , mod - 2 , mod) % mod;
	
}


int main() {
	ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
	cin>>n;
	fac[0] = 1;
	inv[0] = 1;
	for(int i = 1 ; i <= n ; i++){
		fac[i] = fac[i - 1] * i % mod;
	}
	s[1] = 1;
	s[0] = 1;
	for(int i = 2 ; i <= n ; i++){
		s[i] = s[i - 1] * i % mod;
	}
	if(n == 1) {
		cout<<1;
		return 0;
	}
		
	
	
	ll res = 0;
	for(int i = 1 ; i <= n ; i++){
		if(n - i < i - 1) break;
		res += (calc(i) * fac[n - i]) % mod;
		res %= mod;
		//cout<<res<<"\n";
	}
	
	cout<<res;
	
	
	
	
}


//5 4 3 2 1
//5 4 3 2 1