#include<bits/stdc++.h>
#define ll long long

#define x first
#define y second
#define IO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb(x) push_back(x)
#define endl '\n'
#define fix(x) cout << fixed << setprecision(x) ;
#pragma GCC optimize(2)

using namespace std;
typedef pair<int,int>PII;
typedef pair<double,double>PDD;
typedef pair<int,PII>PIP;
typedef pair<PII,int>PPI;
typedef vector<int>VI;
const int N =5e5+5;
const long long INF = 1e16;
int mod= 998244353;


ll a[10000001];
int kpow(int x,int n);
ll inv[10000001];
vector<int>p;
ll A(int n,int x){
//	cout<<n<<" "<<n-x<<endl;
//	cout<<a[n]<<" "<<a[n-x]<<endl;
	
	return a[n]*inv[n-x]%mod;
	//return a[n]*kpow(a[n-x],mod-2)%mod;
}
inline void Solve(){
	int n;
	cin>>n;
	memset(inv,-1,sizeof inv);
	a[0]=1;
	inv[1]=1;
	inv[0]=1;
	a[1]=1;
	for(int i=1;i<=n;i++){
		a[i]=a[i-1]*i;
		a[i]%=mod;
		inv[i]=kpow(a[i],mod-2);
	}
//	for(int i=1;i<=n;i++){
//		cout<<kpow(inv[i],mod-2)<<endl;
//	}
	ll res =0;
	for(int i=1;i<=n/2+1;++i){
		
		res+=A((n-i),i-1)*(a[n-i]);
	//	cout<<res<<endl;
		res%=mod;
	}
	cout<<res<<endl;
}
	

//1 0.75
signed main(){
//	IO
//	fix(16);

	int T=1;
//	cin>>T;
	for(int i=1;i<=T;i++){
	
	
		Solve();
	}
	return 0;
	
}

/*

*/

int lowbit(int n)
{
	return n&-n;
}

inline void read(int &x)
{
   int f=0;x=0;char c=getchar();
   while(c<'0'||c>'9')f|=c=='-',c=getchar();
   while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
   x=f?-x:x;
}
inline void print(long long x)
{
    if(x<0){
        putchar('-');
        x=-x;
    }
    if(x>9) print(x/10);
    putchar(x%10+'0');
}

//ofstream out("file.txt");
//ifstream in("file.txt"); 
inline int kpow(int x,int y){
	if(y==0)return 1;
	if(x==0)return 0;
	long long res =1;
	long long p=x;
	for(int i=0;y>>i;++i){
		if((y>>i)&1){
			res*=p;
			res%=mod;
		}
		p*=p;
		p%=mod;
	}
	return res;
}