#include <bits/stdc++.h>

template<class t> using vc = std::vector<t>;

using namespace std;
typedef long long ll;

const ll INF = 9023372036854775808ll;
const ll MOD = 998244353ll;

namespace cNk {
    ll F[10000005];
    ll NF[10000005];

    ll C(int n, int k) {
        if (k < 0 || k > n) return 0;
        return F[n] * NF[k] % MOD * NF[n - k] % MOD;
    }

    struct initCNK {
        initCNK() {
            F[0] = 1;
            for (int i = 1; i < 10000005; ++i) F[i] = F[i - 1] * i % MOD;
            {
                ll a = F[10000005 - 1];
                ll b = MOD - 2;
                NF[10000005 - 1] = 1;
                while (b) {
                    if (b & 1) NF[10000005 - 1] = NF[10000005 - 1] * a % MOD;
                    (a *= a) %= MOD, b /= 2;
                }
            }
            for (int i = 10000005; --i;) NF[i - 1] = NF[i] * i % MOD;
        }
    } __initCnk;
};
using namespace cNk;

int main() {
    cin.tie(nullptr)->ios_base::sync_with_stdio(false);
    int n;
    cin >> n;
    ll ans = 0;
    for (int i = 1; i <= n; ++i) ans += C(n - i, i - 1) * F[i - 1] % MOD * F[n - i] % MOD;
    cout << ans % MOD << '\n';
}