// #define _FILE_IO_
// #define _MULTI_TEST_
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/trie_policy.hpp>
using namespace std;

template <typename T>
using asc_queue = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template <typename T>
using des_queue = std::priority_queue<T, std::vector<T>, std::less<T>>;
template <typename key_type>
using order_set = __gnu_pbds::tree<
    key_type, __gnu_pbds::null_type, std::less<key_type>,
    __gnu_pbds::rb_tree_tag,
    __gnu_pbds::tree_order_statistics_node_update
>;
template <typename key_type, typename value_type>
using order_map = __gnu_pbds::tree<
    key_type, value_type, std::less<key_type>,
    __gnu_pbds::rb_tree_tag,
    __gnu_pbds::tree_order_statistics_node_update
>;

using Int = long long;
using pii = pair<int, int>;
using pII = pair<Int, Int>;

constexpr Int mod = 998244353;

Int fac[10000001], inv[10000001];

Int quick_pow(Int a, Int b = mod - 2) {
    Int res = 1;
    while (b) {
        if (b & 1) res = (res * a) % mod;
        a = (a * a) % mod, b >>= 1;
    }
    return res;
}

void solve()
{
    Int n;      cin >> n;

    fac[0] = inv[0] = 1;
    for (int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % mod;
    
    inv[n] = quick_pow(fac[n]);
    for (int i = n - 1; i >= 1; i--) inv[i] = inv[i + 1] * (i + 1) % mod;

    auto C = [&](int n, int m)->Int {
        return fac[n] * inv[m] % mod * inv[n - m] % mod;
    };

    Int ans = 0;
    for (int i = 1; i + i - 1 <= n; i++) {
        ans = (ans + C(n - i, i - 1) * fac[i - 1] % mod * fac[n - i] % mod) % mod;
    }

    cout << ans << '\n';
}

int main(const int argc, const char *argv[], const char *envp[])
{
    cin.tie(nullptr)->ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    #ifdef _FILE_IO_
        freopen("a.in", "r", stdin);
        freopen("a.out", "w", stdout);
    #endif

    int test_case = 1;

    #ifdef _MULTI_TEST_
        cin >> test_case;
    #endif

    while (test_case--) solve();

    return 0;
}