#include <bits/stdc++.h>
using namespace std;
inline long long gcd(long long a, long long b) {
  a = ((a) < 0 ? -(a) : (a));
  b = ((b) < 0 ? -(b) : (b));
  while (b) {
    a = a % b;
    swap(a, b);
  }
  return a;
}
long long ext_gcd(long long A, long long B, long long *X, long long *Y) {
  long long x2, y2, x1, y1, x, y, r2, r1, q, r;
  x2 = 1;
  y2 = 0;
  x1 = 0;
  y1 = 1;
  for (r2 = A, r1 = B; r1 != 0;
       r2 = r1, r1 = r, x2 = x1, y2 = y1, x1 = x, y1 = y) {
    q = r2 / r1;
    r = r2 % r1;
    x = x2 - (q * x1);
    y = y2 - (q * y1);
  }
  *X = x2;
  *Y = y2;
  return r2;
}
inline long long modInv(long long a, long long m) {
  long long x, y;
  ext_gcd(a, m, &x, &y);
  x %= m;
  if (x < 0) x += m;
  return x;
}
const long long inf = 2147383647;
const long long mod = 998244353;
const double pi = 2 * acos(0.0);
const double eps = 1e-9;
long long fact[1000006 + 8], inv[1000006 + 8];
int main() {
  fact[0] = 1;
  for (int i = 1; i <= 1000006; i++) fact[i] = (fact[i - 1] * i) % mod;
  for (int i = 0; i <= 1000006; i++) inv[i] = modInv(fact[i], mod);
  long long n, tmp, tot;
  cin >> n;
  tot = (fact[n] * n) % mod;
  tot = (tot - n + 1 + mod) % mod;
  for (int i = 1; i <= n - 1; i++) {
    tmp = (fact[n] * inv[i]) % mod;
    tmp = (tmp - 1 + mod) % mod;
    tot = (tot - tmp + mod) % mod;
  }
  cout << tot << "\n";
  return 0;
}
