#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e7 + 5;
const int mod = 998244353;
#define endl '\n'
typedef long long ll;
int fac[N], inv[N];
int qs(int a,int b)
{
    int res = 1;
    while(b)
    {
        if(b & 1)res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}
int c(int n,int m)
{
    if(n < 0 || m < 0 || n < m)return 0;
    return fac[n] * inv[m] % mod * inv[n - m] % mod;
}

void solve() 
{
    int n;cin >> n;
    fac[0] = 1;
    for(int i = 1;i <= n;i++)fac[i] = fac[i - 1] * i % mod;
    inv[n] = qs(fac[n], mod - 2);
    
    for(int i = n - 1;i >= 1;i--)
    {
        inv[i] = inv[i + 1] * (i + 1) % mod;
    }
    
    inv[0] = 1;
    int res = 0;
    for(int i = 1;i <= n;i++)
    {
        // cout << c(n - i, i - 1) << endl;
        (res += c(n - i, i - 1) * fac[i - 1] % mod * fac[n - i] % mod) %= mod;
    }
    cout << res << endl;
    

}

signed main()
{
    ios::sync_with_stdio(false);cin.tie(0);
    solve();
}