#include <cstdio>

constexpr int MAXN = 5000 + 2;
constexpr int P = 998244353;

int n, f[MAXN], fac[MAXN];

int quickPower(int x, int k) {
    int ret = 1;
    for (; k; k >>= 1, x = (long long){x} * x % P) {
        if (k & 1) {
            ret = (long long){ret} * x % P;
        }
    }
    return ret;
}

int inverse(int x) {
    return quickPower(x, P - 2);
}

void add(int &x, int y) {
    (x += y) >= P && (x -= P);
}

int solve(int x) {
    int ret = 0;
    for (int i = 1; i <= n; i ++) {
        f[i] = 0;
    }
    f[x] = 1;

    for (int i = n + x - 3; i <= n; i ++) {
        add(ret, (long long){f[i]} * fac[n - 1] % P);
    }

    for (int i = 2; i <= n; i ++) {
        for (int j = n; j > 2; j --) {
            f[j] = ((long long){f[j - 1]} + f[j - 2] + f[j - 3]) % P * i % P;
        }
        f[2] = (long long){f[1]} * i % P;
        f[1] = 0;

        for (int j = n + x - 3; j <= n; j ++) {
            add(ret, (long long){f[j]} * fac[n - i] % P);
        }
    }

    return ret;
}

int main() {
    scanf("%d", &n);

    fac[0] = 1;
    for (int i = 1; i <= n; i ++) {
        fac[i] = (long long){fac[i - 1]} * i % P;
    }

    int ans = ((long long){solve(1)} + solve(2) + solve(3)) * inverse(fac[n]) % P;
    printf("%d\n", (n + 1 - ans + P) % P);

    return 0;
}