#include <bits/stdc++.h>

using namespace std;
typedef long long LL;
//unsigned 
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
const int INF = 0x3f3f3f3f;
const int dx[4]={1, 0, -1, 0}, dy[4]={0, 1, 0, -1};
const int fx[8] = {-1, -1, 0, 1, 1, 1, 0, -1}, fy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const double eps=1e-6;

const int N = 1e7+10, P = 998244353;

template <typename T>
struct Comb {
    int n, mod;
    vector<T> fac, finv;
    Comb(int n, int mod) : n(n), mod(mod) 
    {
        fac.resize(n + 1);
        finv.resize(n + 1);
        fac[0] = 1;
        for (int i = 1; i <= n; i++) 
        {
          fac[i] = fac[i - 1] * i % mod;
        }
    
        finv[n] = qpow(fac[n], mod - 2);
        for (int i = n; i; i--) 
        {
          finv[i - 1] = finv[i] * i % mod;
        }
  }

    T qpow(T base, T exp) 
    {
        T ret = 1;
        while (exp) 
        {
            if (exp & 1)
            {
                ret = ret * base % mod;
            }
          base = base * base % mod;
          exp >>= 1;
        }
        return ret;
  }

    T A(int n, int m) { return fac[n] * finv[n - m] % mod; }

    T C(int n, int m) 
    {
        if (n<0 || m<0 || n<m)return 0;
        return fac[n] * finv[n - m] % mod * finv[m] % mod; 
    }
};


void solve()
{   
    int n;
    cin >> n;
    LL ans = 0;
    Comb<LL> comb(n,P);
    for (int i = 1; i<=n; i++){
        ans = (ans + comb.C(n-i,i-1) * comb.fac[n-i] % P * comb.fac[i-1] % P) % P; 
    }
    cout << ans <<'\n';
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    //cout.precision(6); cout.setf(ios::fixed);
    int t = 1;
    //cin >> t;
    while (t--)
    solve();    

    return 0;
}