#include<iostream>
#include<algorithm>
#include<cstring>

using namespace std;

typedef long long ll;

const int N = 10000010;
const ll mod = 998244353;

int n;
ll f[N], inv[N];

ll qpow(ll a, ll x){
    ll res = 1;
    while (x){
        if (x & 1) res = res * a % mod;
        x >>= 1;
        a = a * a % mod;
    }
    return res;
}

void init(int n){
    f[0] = 1;
    for (int i = 1; i <= n + 1; i ++ )
            f[i] = f[i - 1] * i % mod;
    inv[n + 1] = qpow(f[n + 1], mod - 2);
    for (int i = n; i >= 0; i -- )
            inv[i] = inv[i + 1] * (i + 1) % mod;
}

ll c (int a, int b){
    if (b > a) return 0;
    return f[a] * inv[b] % mod * inv[a - b] % mod;
}

int main(){
    scanf("%d", &n);
    init(n);
    ll ans = 0;
    for (int i = 1; i <= n; i ++ )
        ans += c(n - i, i - 1) * f[i - 1] % mod * f[n - i] % mod, ans %= mod;
    printf("%lld", ans);
}