#include <bits/stdc++.h>
using namespace std;
int64_t fact[1000002];
int64_t ans;
int gcdExtended(int a, int b, int *x, int *y);
int modInverse(int b, int m) {
  int x, y;
  int g = gcdExtended(b, m, &x, &y);
  if (g != 1) return -1;
  return (x % m + m) % m;
}
int64_t modDivide(int64_t a, int64_t b, int64_t m) {
  a = a % m;
  int inv = modInverse(b, m);
  return (inv * a) % m;
}
int gcdExtended(int a, int b, int *x, int *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  int x1, y1;
  int gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
int main() {
  int64_t n;
  cin >> n;
  if (n == 1)
    cout << "1\n";
  else {
    fact[0] = 1;
    for (int i = 1; i <= n; i++) fact[i] = (fact[i - 1] * i) % 998244353;
    int64_t t = modDivide(fact[n], 2, 998244353);
    if (n != 2) ans = (t * (n - 1)) % 998244353;
    for (int i = n - 2; i > 1; i--) {
      t = (t * (n - i)) % 998244353;
      t = modDivide(t, n - i - 1, 998244353);
      t = modDivide(t, n - i + 1, 998244353);
      ans += (t * i) % 998244353;
    }
    ans = (ans + n) % 998244353;
    cout << ans << endl;
  }
  return 0;
}
