#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define ull unsigned long long
using PII = pair<int, int>;
using ld = long double;
const int N = 1e7 + 5, M = 998244353;
 
typedef __int128 lll;
istream &operator>>(istream &cin, lll &x) { x=0; static string s; cin>>s; for (char c:s) x=x*10+(c-'0'); return cin; }
ostream &operator<<(ostream &cout, lll x) { static char s[60]; int tp=1; s[0]='0'+(x%10); while (x/=10) s[tp++]='0'+(x%10); while (tp--) cout<<s[tp]; return cout; }
 
mt19937_64 rng{ chrono::steady_clock::now().time_since_epoch().count() };

ll fac[N + 5], inv[N + 5];
ll C(ll m, ll n) {
	if (m > n)return 0;
	return fac[n] * inv[n - m] % M * inv[m] % M;
}
ll A(ll m, ll n) {
    if (m > n)return 0;
    return fac[n] * inv[n - m] % M;
}
ll ksm(ll a, ll b = M - 2) {
	ll s = 1;
    for (; b > 0; b >>= 1, (a *= a) %= M)if (b & 1)(s *= a) %= M;
	return s;
}
void init() {
    fac[0] = inv[0] = 1;
	for (int i = 1; i <= N; i++)fac[i] = fac[i - 1] * i % M;
	inv[N - 1] = ksm(fac[N - 1]);
    for (int i = N - 2; i > 0; i--)inv[i] = inv[i + 1] * (i + 1) % M;
}

void solve() {
    ll n;
    cin >> n;
    ll ans = 0;
    init();
    for (int i = 1;i <= n;i++) {
        ans = (ans + A(i - 1, n - i) * A(n - i, n - i)) % M;
        // cout << ans << endl;
    }
    cout << ans;
}
 
signed main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int tt = 1;
    // cout << fixed << setprecision(5);
    // cin >> tt;
    while (tt--)solve();
}