#include <bits/stdc++.h>
#define int long long
#define ios ios::sync_with_stdio(0), cin.tie(0)
#define fc first
#define sc second
#define setbit(x, y) x |= (1 << y)
#define clrbit(x, y) x &= ~(1 << y)
#define reversebit(x, y) x ^= (1 << y)
#define getbit(x, y) ((x) >> (y)&1)
using namespace std;
typedef long long LL;

const int mod =  998244353, N = 1e7+10;

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;
}

signed main()
{
    ios;
    

    int n;
    cin>>n;
    C_init(n);
    int res=0;
    for(int i=1;i<=n;i++){
        res=(res+C(n-i,i-1)*fac[i-1]%mod*fac[n-i]%mod)%mod;
    }
    cout<<res;
    return 0;
}