//It's MyGO!!!
//All OK
#include <bits/stdc++.h>
#define ios ios::sync_with_stdio(0);cin.tie(nullptr);cout.tie(0);cout << fixed << setprecision(7)
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define LNF (1ll << 60)
#define ll long long
#define ull unsighed long long
// #define int long long
#define mod 998244353
// #define mod 1000000007
using namespace std;

const int N = 1e7 + 10;
ll f[N], a[N];

ll qmi(ll a, ll b){
    ll res = 1;
    while(b){
        if(b & 1) res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}

void init(int n){
    f[0] = 1;
    for(int i = 1; i <= n; i ++)
        f[i] = f[i - 1] * i % mod;
    a[n] = qmi(f[n], mod - 2);
    for(int i = n; i > 0; i --)
        a[i - 1] = a[i] * i % mod;
}

void solve(){
    int n; cin >> n;
    init(n);
    ll ans = 0;
    for(int i = 1; n - i >= i - 1; i ++)
        ans = (ans + f[n - i] * f[n - i] % mod * a[n - 2 * i + 1] % mod) % mod;
    cout << ans;
}

signed main(){
    ios;

    // init();
    int _ = 1;
    // cin >> _;
    for(int __ = 1; __ <= _; __ ++){
        // cout << "Case #" << __ << ": ";

        solve();
    }
    return 0;
}