#include<bits/stdc++.h>

using namespace std;
const int mo = 998244353;
const int maxn = 1e7 + 7;
using ll = long long;
int fc[maxn],inv[maxn];
int qp(int a,int b) {
  int ans = 1,base = a;
  while(b != 0) {
    if(b & 1) ans = 1ll * ans * base % mo;
    base = 1ll * base * base % mo;
    b >>= 1;
  }
  return ans % mo;
}
int main() {
  int n;
  cin >> n;
  fc[0] = 1;
  for(int i = 1;i <= n;i ++) fc[i] = 1ll * fc[i - 1] * i % mo;
//  cerr << f1c[n - 1] << endl;
//  ll ans1 = fc[n - 1] * (n + 1) / 4; 
//  int inv2 = (mo + 1) / 2;
//  cerr << ans1 << " " << qp(2,mo - 2) << " " <<  (mo + 1) / 2 << endl;
//  int x = n / 2 - 1;
//  ll ans = 1ll * fc[n - 1] * (n + 1) % mo * qp(x,mo - 2) % mo;
  ll ans = 0;
  inv[n] = qp(fc[n],mo - 2);
  for(int i = n - 1;i >= 0;i --) inv[i] = 1ll * inv[i + 1] * (i + 1) % mo;
  auto A = [&](int n,int m) {
    return 1ll * fc[n] * inv[n - m] % mo;
  };
  for(int i = 1;i <= n;i ++) {
    if(i + i - 1 <= n) {
      
      ans += 1ll * A(n - i,i - 1) * fc[n - i] % mo;
      ans %= mo;
    }
  }
//  cerr << tmp << endl;
  cout << ans % mo << endl;
}