/**
 *    author:  Huan
 *    created: 2023-08-20 10:52:00
 *    再强一点点就好了(＞﹏＜)
**/
#include <bits/stdc++.h>

using namespace std;
#define ll long long
const int MAXN = 1e7 + 10;
const int mod = 998244353;


ll qpow(ll b, ll p) {
	ll res = 1;
	for (; p; p >>= 1, b = b * b % mod) if (p & 1) res = res * b % mod;
	return res;
}

ll fac[MAXN], ifac[MAXN];


void init(int n) {
	*fac = 1;
	for (int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % mod;
	ifac[n] = qpow(fac[n], mod - 2);
	for (int i = n; i; i--) ifac[i - 1] = ifac[i] * i % mod;
}


ll c(int m, int n) {
	return fac[n] * ifac[m] % mod * ifac[n - m] % mod;
}

ll A(int m, int n) {
	return fac[n] * ifac[n - m] % mod;
}
void solve() {
    int n;
    cin >> n;
    ll sum = 0;

    for (int i = 1; i <= n; i ++ ){
        if (n - 2 * i + 1 >= 0){
            int x = n - i;
            sum =(fac[x] * (A(i - 1,x)) % mod + sum + mod) % mod;
        }
        else {
            break;
        }
    }

    cout << sum << endl;
}


signed main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL);
  int tt = 1; //cin >> tt;
   init(1e7);
  while (tt--) solve();

  return 0;
}