template<class T,class T2> int chkmn(T &a,T2 b){return a>b?a=b,1:0;}
template<class T,class T2> int chkmx(T &a,T2 b){return a<b?a=b,1:0;}
#include <bits/stdc++.h>
using namespace std;
#define V vector
#define all0(x) (x).begin(),(x).end()
#define all1(x) (x).begin()+1,(x).end()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define cin std::cin
#define cout std::cout
typedef long long LL;
typedef pair<int, int> pi;
typedef pair<LL, LL> pl;
#ifdef LOCAL
#include "C:/Users/lijia/Desktop/vscode/algo/debug.h"
#else
#define debug(...) 42
#endif

//const int MN = 2e5 + 20;//MaxN 记得改一下
const int INF = 2e9+1000;//INF
const LL INFLL = 8e18+1000;//INF long long 
mt19937 mrand(random_device{}());
//模板区域~~~~~~~

//模板结束~~~~~~~
const int mod = 998244353;
LL qpow(int x, LL k) {
    LL ans = 1;
    while(k) {
        if(k & 1) ans = ans * x % mod;
        x = 1LL * x * x % mod;
        k /= 2;
    }
    return ans;
}
LL inv(int x) {
    return qpow(x, mod - 2);
}
void solve() {
    int n; cin >> n;
    V<LL> fac(n + 1);
    V<LL> ifac(n + 1);
    fac[0] = 1;
    for(int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % mod;
    ifac[n] = inv(fac[n]);
    for(int i = n - 1; i >= 0; i--) {
        ifac[i] = ifac[i + 1] * (i + 1) % mod;
    }
    auto A = [&](int x, int k) -> LL {
        if(k > x || k < 0) return 0;
        return fac[x] * ifac[x - k] % mod;
    };
    LL ans = 0;
    for(int i = 1; i <= n; i++) {
        //A(n - i, i - 1) * fac(n - i);
        ans += A(n - i, i - 1) * fac[n - i] % mod;
        if(ans >= mod) ans -= mod;
    }
    cout << ans << endl;
}
int32_t main() {
#ifndef LOCAL
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#endif
    int tt=1;
    //cin >> tt;
    while (tt--) 
    solve();
}