#include <iostream>
#define int long long
using namespace std;

const int N = 1e7 + 10, mod = 998244353;
int f[N];
int fp[N];

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

void init()
{
    f[0] = 1;
    for (int i = 1; i < N; i++)
        f[i] = f[i - 1] * i % mod;

    fp[N - 1] = qmi(f[N - 1], mod - 2);
    for (int i = N - 2; i >= 0; i--)
        fp[i] = fp[i + 1] * (i + 1) % mod;
}

int get(int up, int down)
{
    return (f[down] * fp[up] % mod) * fp[down - up] % mod;
}

signed main()
{
    init();
    int n;
    cin >> n;
    int ans = 0;

    for (int i = 1; i <= (n + 1) / 2; i++)
    {
        ans = (ans + ((f[i - 1] * get(i - 1, n - i) % mod) * f[n - i]) % mod) % mod;
    }
    cout << ans;
}