#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<numeric>
#include<stack>
#include<string>
#include<vector>
#include<unordered_map>
#include<algorithm>
#include<cmath>
#include<cstring>
#include <bitset>
#include <map>
#include<queue>
#include <set>
#include<unordered_set>
#include<algorithm>
#include <functional>
#include <iomanip>
#include <time.h>
#define int long long
#define endl '\n'
#define  X first
#define  V second
#define ce cout << endl;
#define lowbit(x) (x & -x)
using namespace std;
using LL = long long;
using pii = pair<int, int>;
using pdi = pair<double, int>;
using pip = pair<int, pii>;
using tiii = tuple<int, int, int>;
inline void ini();
const int mod = 998244353;
const int N = 1e7 + 5;

int fac[N];
int inv[N];
int qmi(int a, int b) {
	int res = 1;
	while (b) {
		if (b & 1) res = res * a % mod;
		b /= 2;
		a = a * a % mod;
	}
	return res;
}
int C(int a, int b) {
	if (b < 0 || b > a) return 0;
	return fac[a] * inv[b] % mod * inv[a - b] % mod;
}
void solve() {
	int n;
	int res = 0;
	cin >> n;
	for (int i = 1; i <= n; i++) (res += C(n - i, i - 1) * fac[i - 1] % mod * fac[n - i] % mod) %= mod;
	cout << res%mod << endl;
}
void ini() {
	fac[0] = fac[1] = 1;
	for (int i = 2; i < N; i++) fac[i] = fac[i - 1] * i % mod;
	inv[N - 1] = qmi(fac[N - 1], mod - 2);
	for (int i = N - 2; i >= 0; i--) inv[i] = inv[i + 1] * (i + 1) % mod;
}
signed main() {

//	freopen("D:\\debug.txt", "r", stdin);

	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	ini();

	int T = 1;
	while (T--)
		solve();

	return 0;
}