#include<bits/stdc++.h>
using namespace std;

typedef pair<int, int> PII;
typedef long long LL;

const int N = 2e5 + 10, mod = 998244353;
int q_pow(int a, int b){
    int res = 1ll % mod;
    while(b){
        if(b & 1)res = res * a % mod;
        a = a * a % mod, b>>= 1;
    }
    return res;
}
LL fac[N];
LL jv[N], inv[N];
void C_init(int n) {
    inv[1] = 1;
    for (int i = 2; i <= n; i++) {
        inv[i] = (mod - mod / i) * inv[mod % i] % mod;
    }
    jv[0] = fac[0] = 1;
    for (int i = 1; i <= n; i++) {
        fac[i] = fac[i - 1] * i % mod;
        jv[i] = jv[i - 1] * inv[i] % mod;
    }
}
LL C(int n, int m) {
    if (n < m || m < 0) return 0;
    return fac[n] * jv[n - m] % mod * jv[m] % mod;
}
LL A(int n,int m){
    return C(n,m)*fac[m]%mod;
}
LL lucas(int n, int m) {
    if (m == 0) return 1;
    return C(n % mod, m % mod) * lucas(n / mod, m / mod) % mod;
}

signed main(){
    LL n;
    cin >> n;
    C_init(n+10);
    LL ans = 0;
    LL x=n-1,y=0;
    while(x>=y){
        ans=(ans+A(x,y)*A(x,x)%mod)%mod;
        x--,y++;
    }
    cout<<ans<<endl;
}