#include <bits/stdc++.h>

template<typename T, std::size_t N> std::istream& operator>>(std::istream& is, std::array<T, N>& v) { for (auto& i : v) is >> i; return is; }
template<typename T, std::size_t N> std::ostream& operator<<(std::ostream& os, std::array<T, N>& v) { for (auto& i : v) os << i << " "; return os; }
template<typename T> std::istream& operator>>(std::istream& is, std::vector<T>& v) { for (auto& i : v) is >> i; return is; }
template<typename T> std::ostream& operator<<(std::ostream& os, std::vector<T>& v) { for (auto& i : v) os << i << " "; return os; }
template<typename T> auto dbug(const std::initializer_list<T>& a) { std::cerr << "dbug: "; for (auto& i : a) std::cerr << i << " "; std::cerr << std::endl; }

using i64 = long long;

constexpr int N = 1e7;
constexpr int P = 998244353;

bool is_init;
int fac[N + 1], invfac[N + 1];

constexpr i64 power(i64 a, i64 b) {
    i64 res = 1;
    for (; b; b /= 2, a = a * a % P) {
        if (b % 2) {
            res = res * a % P;
        }
    }
    return res;
}

void init() {
    fac[0] = 1;
    for (int i = 1; i <= N; i++) {
        fac[i] = 1LL * fac[i - 1] * i % P;
    }
    invfac[N] = power(fac[N], P - 2);
    for (int i = N; i >= 1; i--) {
        invfac[i - 1] = 1LL * invfac[i] * i % P;
    }
    is_init = true;
}

int binom(int n, int m) {
    if (!is_init) init();
    if (n < m || m < 0) {
        return 0;
    }
    return 1LL * fac[n] * invfac[m] % P * invfac[n - m] % P;
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    init();

    int n;
    std::cin >> n;

    int ans = fac[n - 1];
    for (int i = 2; i <= n; i++) {
        ans = (1LL * ans + 1LL * fac[n - i] % P * binom(n - i, i - 1) % P * fac[i - 1] % P) % P;
    }

    std::cout << ans << "\n";

    return 0;
}