#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define int long long
const int N = 1e7 + 10, mod = 998244353;
long long f[N], infact[N];
LL qmi(LL a, LL k, LL p)
{
    LL res = 1;
    while (k)
    {
        if (k & 1)
            res = res * a % p;
        a = a * a % p;
        k >>= 1;
    }
    return res;
}
inline int c(int a, int b, int p) { return f[a] * infact[b] % p * infact[a - b] % p; }
void init_ass_two(int p, int n)
{
    f[0] = infact[0] = 1;
    // N的值是a和b的最大范围
    for (int i = 1; i <= n; i++)
    {
        f[i] = i * f[i - 1] % p;
    }
    infact[n] = qmi(f[n], p - 2, p);
    for (int i = n - 1; i >= 0; i--)
    {
        infact[i] = infact[i + 1] * (i + 1) % mod;
    }
} // cout<<c(a,b,p)<<'\n';
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    init_ass_two(mod, n);

    int mid = n / 2;
    if (n % 2 == 1)
        mid++;

    int res = 0;
    for (int i = 1; i <= mid; i++)
    {
        int x = 1;
        x = (x * c(n - i, i - 1, mod)) % mod;
        x = (x * f[i - 1]) % mod;
        x = (x * f[n - i]) % mod;

        res = (res + x) % mod;
    }

    cout << res;

    return 0;
}