#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 5e3 + 5, Mod = 998244353;
int n, c[N], fac[N], ans, inv[N];
int quickpow(int a, int b)
{
    int res = 1;
    while(b)
    {
        if(b & 1)
            res = res * a % Mod;
        a = a * a % Mod;
        b >>= 1;
    }
    return res;
}
int Inv(int x)
{
    return quickpow(fac[x], Mod - 2);
}
int C(int n, int m)
{
    if(n < m)
        return 0;
    return fac[n] * inv[m] % Mod * inv[n - m] % Mod;
}
int calc(int k, int m)
{
    if(k < 0 || m - 1 < 0 || m - 1 < k)
        return 0;
    if(!k)
        return m == 1 ? 1 : 0;
    int res = 0;
    for(int a = 0; a <= k; a++)
    {
        int b = 3 * k - 2 * a - m + 1,
            c = a + m - 1 - (k << 1);
        if(b >= 0 && c >= 0)
            res = (res + C(k, a) * C(k - a, b) % Mod) % Mod;
    }
    return res;
}
signed main()
{
    cin >> n;
    fac[0] = inv[0] = 1;
    for(int i = 1; i <= n; i++)
        fac[i] = fac[i - 1] * i % Mod, inv[i] = Inv(i);
    for(int k = (int)ceil(n * 1.0 / 3); k <= n - 2; k++)
    {
        int res = (calc(k - 2, n - 3) * 2 % Mod + calc(k - 2, n - 4) + calc(k - 1, n - 2)) % Mod;
        res = (res * n % Mod * fac[k - 1] % Mod * fac[n - k] % Mod);
        ans = (ans + res * k % Mod) % Mod;
    }
    cout << ans * inv[n] % Mod;
    return 0;
}