#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 1e7 + 10, INF = 0x3f3f3f3f, mod = 998244353;

inline int read() {
    int f = 1, k = 0;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-') f = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        k = k * 10 + c - '0';
        c = getchar();
    }
    return f * k;
}

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

void add(ll &a, ll b) {
    a += b;
    if (a >= mod) a -= mod;
}

ll fact[N], invfact[N];
ll P(ll a, ll b) {
    if (a < b) return 0;
    return fact[a] * invfact[a - b] % mod;
}

int main() {
    // ios::sync_with_stdio(0); cin.tie(0);
    int n = read();
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i - 1] * i % mod;
    invfact[n] = qmi(fact[n], mod - 2);
    for (int i = n; i; --i) invfact[i - 1] = invfact[i] * i % mod;
    // if (n == 1) return puts("1"), 0;
    ll ans = 0;
    for (int i = 1; i <= n; ++i) {
        add(ans, P(n - i, i - 1) * fact[n - i] % mod);
    }
    printf("%lld\n", ans);
}