#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
#define IOS std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
const long double PI = acos(-1);
const ll mod = 998244353;
const int maxn = 1e7 + 7;
const int P = 13331;

ll qgcd(ll a, ll b) {
    return b == 0 ? a : qgcd(b, a % b);
}

ll qpow(ll a, ll b) {
    ll ans = 1;
    while (b) {
        if (b & 1)
            ans = ans * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return ans % mod;
}

ll n;
ll d[maxn];

void solve() {
	cin >> n;
	if (n == 1 || n == 2) {
		cout << 1;
		return;
	}
	d[0] = 1;
	for (ll i = 1; i <= n; i++) {
		d[i] = d[i - 1] * i % mod;
	}
	ll ans = 0;
	for (int i = 1; i <= (n + 1) / 2; i++) {
		ans = (ans + d[n - i] * qpow(d[i - 1] * d[(n - 2 * i + 1)] % mod, mod - 2) % mod * d[n - i] % mod * d[i - 1] % mod) % mod;
	}
	cout << ans;
}

int main() {
    IOS;
    int T = 1;
//    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}

/*

*/