#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e7 + 10, mod = 998244353;
int fact[N], infact[N], xiaoyu[N];
int qmi(int a, int b, int p)
{
    int res = 1;
    while (b)
    {
        if (b & 1) res = res * a % p;
        a = a * a % p;
        b >>= 1;
    }
    return res;
}
int c(int a, int b)
{
    return fact[a] * infact[b] % mod * infact[a - b] % mod;
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int ans = 0;
    int n;
    cin >> n;
    fact[0] = infact[0] = 1;
    for (int i = 1; i <=n; i++)
    {
        fact[i] = fact[i - 1] * i % mod;
    }
    infact[n] = qmi(fact[n], mod - 2, mod);
    for (int i = n - 1; i >= 0; i--)
    {
        infact[i] = infact[i + 1] * (i + 1) % mod;
    }
    xiaoyu[0] = 1;
    for (int i = 1; i <= n; i++) xiaoyu[i] = (xiaoyu[i - 1] * i) % mod;
    for (int i = 1; i <= (n + 1) / 2; i++)
    {
        ans = (ans + c(n - i, i - 1) * xiaoyu[n - i] % mod * xiaoyu[i - 1] % mod) % mod;
    }
    cout << ans << endl;
    return 0;
}