#include <bits/stdc++.h>
#define ll long long
const ll mod = 998244353;
#define int long long
using namespace std;
namespace CNM {
const int N = 1e7 + 5;
int quick(int x, int n) {
  int res = 1;
  while (n) {
    if (n & 1)
      res = (res * x) % mod;
    x = (x * x) % mod;
    n >>= 1;
  }
  return res;
}
int inv(int x) { return quick(x, mod - 2); }
int fac[N], invfac[N];
void init() {
  fac[0] = 1;
  for (int i = 1; i < N; i++)
    fac[i] = (fac[i - 1] * i) % mod;
  invfac[N - 1] = inv(fac[N - 1]);
  for (int i = N - 2; i >= 0; i--)
    invfac[i] = (invfac[i + 1] * (i + 1)) % mod;
}
int C(int n, int m) {
  if (n < m || m < 0)
    return 0;
  return fac[n] * invfac[m] % mod * invfac[n - m] % mod;
}
} // namespace CNM
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  CNM::init();
  int n;
  cin >> n;
  ll ans = 0;
  for (int i = 1; i <= (n + 1) / 2; i++) {
    ans = (ans + CNM::C(n - i, n + 1 - 2 * i) % mod * CNM::fac[n - i] % mod *
                     CNM::fac[i - 1] % mod) %
          mod;
  }
  cout << ans;
  return 0;
}