#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int N = 10000010;
ll jie[N];
const ll mod = 998244353;

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


int main()
{
    int n;
    cin >> n;
    jie[0] = 1;
    for(int i = 1;i<=n;i++){
        jie[i] = jie[i-1] % mod * i % mod;
    }
    // for(int i = 1;i<=10;i++){
    //     cout << jie[i] << " \n"[i == 10];
    // }
    ll ans = 0;
    for(ll i = 1;i<=n;i++){
        ll tmp1 = (jie[n-i] * jie[n-i]) % mod;
        if(n - 2*i + 1 < 0) continue;
        ll tmp2 = jie[n - 2*i + 1];
        tmp2 = qmi(tmp2,mod-2,mod);
        ans += tmp1 * tmp2 % mod;
        ans %= mod;
    }
    ans %= mod;
    cout << ans << endl;
    // system("pause");
    return 0;
}