#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000005;
const long long MOD = 998244353;
int n;
long long ans;
long long c[MAXN << 1];
long long fac[MAXN];
long long inv[MAXN];
long long power(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) (res *= a) %= MOD;
    (a *= a) %= MOD;
    b >>= 1;
  }
  return res;
}
int main() {
  cin >> n;
  fac[0] = 1;
  for (int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % MOD;
  inv[n] = power(fac[n], MOD - 2);
  for (int i = n; i >= 1; i--) inv[i - 1] = inv[i] * i % MOD;
  ans = n * fac[n] % MOD;
  ans = ans * (ans + 1) / 2 % MOD;
  c[0] = n;
  for (int i = 1; i < n; i++)
    c[i] = fac[n] * inv[n - i + 1] % MOD *
           ((long long)(n - i) * (n - i) % MOD + 1) % MOD;
  for (int i = n; i < 2 * n; i++) c[i] = fac[n] - c[i - n];
  for (int i = 1; i < 2 * n; i++) (ans -= c[i] * i) %= MOD;
  printf("%lld\n", (ans + MOD) % MOD);
  return 0;
}
