#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define endl '\n'
#define x first
#define y second
#define stop cout << "?" << '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e7 + 10, M = 7e5;
const ll mod = 998244353;
const double pi = acos(-1);
int n, m;
ll fac[N], invfac[N];
ll qmi(ll a, ll b = mod - 2)
{
    a %= mod;
    ll res = 1;
    while (b)
    {
        if (b & 1)
            res = res * a % mod;
        b >>= 1;
        a = a * a % mod;
    }
    return res;
}
void init()
{
    //   int n = 1e7+10;
    fac[0] = 1; // fac[i]表示i的阶乘，invfac[i]表示i的阶乘的逆元
    for (int i = 1; i <= n; i++)
        fac[i] = fac[i - 1] * i % mod;
    invfac[n] = qmi(fac[n]); // 快速幂
    for (int i = n - 1; i >= 0; i--)
        invfac[i] = invfac[i + 1] * (i + 1) % mod;
    // C(n,m)=fac[n] * invfac[m] % mod * invfac[n - m] % mod;
}
ll C(int n, int m)
{
    if (n < m || m < 0) // 注意判断是否合法
        return 0;
    return fac[n] * invfac[m] % mod * invfac[n - m] % mod;
}

void solve()
{
    cin >> n;
    init();
    ll ans = 0;
    for (int i = 1; i <= n; i++)
    {
        ll res = C(n - i, i - 1) * fac[n - i] % mod * fac[i - 1] % mod;
        ans = (ans + res) % mod;
        // cout << C(1, 0) << endl;
        // ans %= mod;
    }
    cout << ans << endl;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    // cin >> _;
    while (_--)
        solve();
    return 0;
}