//#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<stdio.h>
#include<map>
#include<stack>
#include<set>
#include<vector>
#include<utility>
#include<algorithm>
#include<unordered_map>
using namespace std;
#define int long long
inline int read(){
    int x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9'){
        if(ch=='-')f=-1;
        ch=getchar();
    }while(ch>='0'&&ch<='9'){
        x=x*10+ch-'0',ch=getchar();
    }return x*f;
}
void write(int x){
    if(x<0)putchar('-');
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
const int inf=0x3f3f3f3f3f3f3f3f;
const int N=1e7+5,M=500+5;
const int mod=998244353;
typedef pair<int,int>pii;
int T,n,m,x,y,l,r;
int mn=inf;
int rt;
vector<int>nd[N];
int fac[N],ifac[N];
int quickp(int base,int pow=mod-2){
    int res=1;
    while(pow){
        if(pow&1){
            res=res*base%mod;
        }pow>>=1;
        base=base*base%mod;
    }return res;
}
void init(){
    fac[0]=ifac[0]=1;
    for(int i=1;i<N;i++){
        fac[i]=fac[i-1]*i%mod;
    }ifac[N-1]=quickp(fac[N-1]);
    for(int i=N-2;i;i--)ifac[i]=ifac[i+1]*(i+1)%mod;
}
int C(int n,int m){
    if(n<m)return 0;
    return fac[n]*ifac[m]%mod*ifac[n-m]%mod;
}
signed main(){

    //T=read();
    init();
    T=1;
    while(T--){
        n=read();
        int r=0;
        for(int i=1;i<=n;i++){
            //if(i-1>n-i)break;
            r=(r+C(n-i,i-1)*fac[i-1]%mod*fac[n-i])%mod;
            //r=(r+fac[i-1])%mod;
            //printf("%lld r:%lld\n",C(n-i,i-1)*fac[i-1],r);
        }write(r);
    }
    return 0;
}