// writer: w33z8kqrqk8zzzx33
#include <bits/stdc++.h>
using namespace std;

// end fast read template by CYJian

#define iter(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, a) iter(i, 0, a)
#define rep1(i, a) iter(i, 1, (a) + 1)
#define fi first
#define se second
#define pb push_back

#define ll long long
#define pii pair<int, int>

// #define int ll
const int MOD = 998244353;

int fac[524300], ifac[524300], inv[524300];
int ini[524300], bern[524300];

int d[524300];
int S[524300], f[524300], g[524300], h[524300];
int answer[524300];
namespace poly
{
    const int MOD = 998244353;
    const int IMAG = 86583718;
    const int NTTG = 3;

    int rev[524300];
    int minv[524300];
    int w[20][2][524300];

    int qpow(int b, int e)
    {
        int re = 1;
        while (e)
        {
            if (e & 1)
                re = 1ll * re * b % MOD;
            b = 1ll * b * b % MOD;
            e >>= 1;
        }
        return re;
    }

    void constructrev(int n)
    {
        for (int i = 1, j = 0; i < n; i++)
        {
            int bit = n >> 1;
            for (; j & bit; bit >>= 1)
                j ^= bit;
            j ^= bit;
            rev[i] = j;
        }
    }

    void constructroot(int n)
    {
        minv[1] = 1;
        iter(i, 2, n + 1)
            minv[i] = 1ll * (MOD - MOD / i) * minv[MOD % i] % MOD;
        for (int l = 1; (1 << l) <= n; l++)
            rep(inv, 2)
            {
                int re = inv ? qpow(minv[NTTG], (MOD - 1) >> l) : qpow(NTTG, (MOD - 1) >> l);
                w[l][inv][0] = 1;
                rep1(i, (1 << (l - 1)) - 1) w[l][inv][i] = 1ll * w[l][inv][i - 1] * re % MOD;
            }
    }

    void ntt(int *v, int n, bool inv)
    {
        rep(i, n) if (i < rev[i]) swap(v[i], v[rev[i]]);
        for (int l = 1; (1 << l) <= n; l++)
            for (int i = 0; i < n; i += (1 << l))
            {
                int p = i + (1 << (l - 1));
                iter(j, i, p)
                {
                    int a = v[j], b = 1ll * v[j + (1 << (l - 1))] * w[l][inv][j - i] % MOD;
                    v[j] = (a + b >= MOD ? a + b - MOD : a + b);
                    v[j + (1 << (l - 1))] = (a < b ? a + MOD - b : a - b);
                }
            }
        if (inv)
            rep(i, n) v[i] = 1ll * v[i] * minv[n] % MOD;
    }

    void mult(int *a, int as, int *b, int bs, int *o, bool construct, bool clean = 0, int th = 100000000)
    {
        iter(i, as, as << 1) a[i] = 0;
        iter(i, bs, bs << 1) b[i] = 0;
        int n = as + bs - 1;
        while (n - (n & (-n)))
            n += (n & (-n));
        if (construct)
            constructroot(n);
        constructrev(n);
        ntt(a, n, 0);
        ntt(b, n, 0);
        rep(i, n) o[i] = 1ll * a[i] * b[i] % MOD;
        ntt(o, n, 1);
        iter(i, th, n) o[i] = 0;
        rep(i, n) b[i] = 0;
        if (clean)
            rep(i, n) a[i] = 0;
    }

    void cfn(int *a, int as, int *o)
    {
        static int tmp[524300];
        if (as == 1)
        {
            tmp[0] = a[0];
            o[0] = qpow(a[0], MOD - 2);
            return;
        }
        cfn(a, (as + 1) / 2, o);
        int le = 0;
        while ((1 << le) < (as << 1))
            le++;
        constructrev(1 << le);
        rep(i, as) tmp[i] = a[i];
        iter(i, as, 1 << le) tmp[i] = o[i] = 0;
        ntt(tmp, 1 << le, 0);
        ntt(o, 1 << le, 0);
        rep(i, 1 << le) o[i] = 1ll * (MOD + (2 - 1ll * tmp[i] * o[i]) % MOD) * o[i] % MOD;
        ntt(o, 1 << le, 1);
        iter(i, as, 1 << le) o[i] = 0;
    }

    void init(int n) { constructroot(n); }
    void solve(int as, int *o)
    {
        static int H1i[524300], H[524300], dg[524300], H1[524300], tmp[524300];
        if (as == 1)
        {
            o[0] = 1;
            return;
        }
        solve((as + 1) / 2, o);
        rep(i, as) H1i[i] = o[i], tmp[i] = o[i];
        mult(H1i, as, tmp, as, H1i, false);
        rep(i, as) tmp[i] = o[i];
        tmp[0]++;
        if (tmp[0] >= MOD)
            tmp[0] -= MOD;
        mult(H1i, as, tmp, as, H1i, false);
        rep(i, as) dg[i] = 1ll * o[i + 1] * (i + 1) % MOD;
        cfn(H1i, as, H1);
        rep(i, as) tmp[i] = H1[i];
        mult(dg, as, tmp, as, H, false, true);
        for (int i = as - 2; ~i; i--)
            H[i + 1] = 1ll * H[i] * inv[i + 1] % MOD;
        H[0] = 0, H[1]--;
        if (H[1] < 0)
            H[1] += MOD;
        mult(H, as, H1i, as, tmp, false);
        rep(i, as)
        {
            o[i] -= tmp[i];
            if (o[i] < 0)
                o[i] += MOD;
        }
    }
}

int ncr(int n, int k)
{
    return 1ll * fac[n] * ifac[k] % MOD * ifac[n - k] % MOD;
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    fac[0] = ifac[0] = fac[1] = ifac[1] = inv[0] = inv[1] = 1;
    int n = 2.5e5 + 10;
    iter(i, 2, n + 2)
    {
        inv[i] = 1ll * (MOD - MOD / i) * inv[MOD % i] % MOD;
        fac[i] = 1ll * fac[i - 1] * i % MOD;
        ifac[i] = 1ll * ifac[i - 1] * inv[i] % MOD;
    }
    int th = 1;
    while (th < (n << 1))
        th <<= 1;
    poly::init(th);
    cin >> n;
    poly::solve(n + 1, g);
    for (int i = n; ~i; i--)
        g[i + 1] = 1ll * g[i] * inv[i + 1] % MOD;
    rep(i, n + 1) h[i] = MOD - g[i];
    h[0] = 1;
    poly::cfn(h, n + 1, f);
    cout << 1ll * f[n] * fac[n] % MOD;
}