#include "bits/stdc++.h"

using namespace std;
#define ll long long
const ll MOD = 998244353;
const int MAXN = 10000010;

int f[MAXN];

ll binexp(ll x, ll y) {
  ll mu = 1;
  while (y > 0) {
    if (y % 2) {
      mu *= x;
      mu %= MOD;
      y--;
    }
    else {
      x *= x;
      x %= MOD;
      y /= 2;
    }
  }
  return mu;
}

int main() {

  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);

  int n; cin >> n;

  f[0] = 1;
  for (int i = 1; i < MAXN; i++) {
    f[i] = (((ll)f[i - 1]) * ((ll)i)) % MOD;
  }

  ll ans = 0;
  for (ll i = 1; i <= n; i++) {

    ll rm = n - i;

    // need to choose (i - 1) out of rm
    // then permute them arbitrarily

    if (rm >= i - 1) {
      ll ta = (f[rm] * binexp(f[rm - (i - 1)], MOD - 2)) % MOD;
      ta *= f[rm];
      ta %= MOD;
      ans += ta;
      ans %= MOD;
    }

  }

  cout << ans << "\n";

}