#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ull;
const ll N = 1e7 + 5;
const ll mod = 998244353;
typedef double db;
const double eps = 1e-6;
#define endl '\n'
#define PII pair<ll, ll>
#define fi first
#define se second

ll arr[N];
ll n, m, k;
ll ans;
ll q;

inline int fpow(int a, int b)
{
    if (b == 0)
        return 1;
    int _extra = 1;
    while (b != 1)
    {
        if (b & 1)
            (_extra *= a) %= mod;
        b >>= 1;
        (a *= a) %= mod;
    }
    return a * _extra % mod;
}

int fz[N], fm[N];
void init()
{
    fz[0] = fm[0] = 1;
    for (int i = 1; i <= 1e7; i++)
    {
        fz[i] = fz[i - 1] * i % mod;
    }
    fm[10000000] = fpow(fz[10000000], mod - 2);
    for (int i = 9999999; i >= 1; i--)
    {
        fm[i] = fm[i + 1] * (i + 1) % mod;
    }
}

inline int A(int n, int k)
{
    if (n < k)
        return 0;
    return fz[n] * fm[n - k] % mod;
}

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

    init();

    // cout << C(2, 0) << ' ' << C(5, 2) << '\n';

    ll t, res = 0;
    cin >> t;

    for (int i = 1; i <= t; i++)
    {
        (res += A(t - i, i - 1) * fz[t - i] % mod) %= mod;
        // cout << i << ' ' << C(t - i, i - 1) << ' ' << fz[t - i] << ' ' << res << '\n';
        //cout << C(t - i, i - 1) * fz[t - i] % mod << endl;
    }
    cout << res;
    return 0;
}