#include <iostream>
using namespace std;
#include <algorithm>
#include <vector>
typedef long long ll;

const int N = 1e7 + 10;
int mod = 998244353;
ll a[N];
ll fast_pow(ll a, int n)
{
    ll res = 1;
    while (n)
    {
        if (n & 1)
            res = (res * a) % mod;
        n >>= 1;
        a = (a * a) % mod;
    }
    return res % mod;
}
int main()
{
    ll n;
    cin >> n;
    a[0] = 1;
    for (int i = 1; i <= n; i++)
        a[i] = ((a[i - 1] % mod) * (i % mod)) % mod;
    int s = 0LL;
    for (int i = 1; i <= n; i++)
    {
        if (n - i >= i - 1)
            s = (s + (((a[n - i]) % mod * fast_pow(a[n - i - i + 1], mod - 2)) % mod * a[n - i]) % mod) % mod;
    }
    cout << s % mod << "\n";
}