#include<bits/stdc++.h>
namespace my_std{
    using namespace std;
    #define pii pair<int,int>
    #define fir first
    #define sec second
    #define MP make_pair
    #define rep(i,x,y) for (int i=(x);i<=(y);i++)
    #define drep(i,x,y) for (int i=(x);i>=(y);i--)
    #define go(x) for (int i=head[x];i;i=edge[i].nxt)
    #define templ template<typename T>
    #define mod 998244353ll
    #define sz 202020
    #define N sz<<2
    typedef long long ll;
    typedef unsigned long long u64;
    typedef double db;
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    templ inline T rnd(T l,T r) {return uniform_int_distribution<T>(l,r)(rng);}
    templ inline bool chkmax(T &x,T y){return x<y?x=y,1:0;}
    templ inline bool chkmin(T &x,T y){return x>y?x=y,1:0;}
    templ inline void read(T& t) {
        t=0;char f=0,ch=getchar();double d=0.1;
        while(ch>'9'||ch<'0') f|=(ch=='-'),ch=getchar();
        while(ch<='9'&&ch>='0') t=t*10+ch-48,ch=getchar();
        if(ch=='.'){ch=getchar();while(ch<='9'&&ch>='0') t+=d*(ch^48),d*=0.1,ch=getchar();}
        t=(f?-t:t);
    }
    template<typename T,typename... Args>inline void read(T& t,Args&... args){read(t); read(args...);}
    void file() {
        #ifdef zqj
        freopen("a.in","r",stdin);
        #endif
    }
    inline void chktime() {
        #ifdef zqj
        cerr<<clock()/1000.0<<'\n';
        #endif
    }
    #ifdef mod
    ll ksm(ll x,int y){ll ret=1;for (;y;y>>=1,x=x*x%mod) if (y&1) ret=ret*x%mod;return ret;}
    ll inv(ll x){return ksm(x,mod-2);}
    #else
    ll ksm(ll x,int y){ll ret=1;for (;y;y>>=1,x=x*x) if (y&1) ret=ret*x;return ret;}
    #endif
}
using namespace my_std;

ll fac[sz],_fac[sz],_inv[sz];
void _init(){_fac[0]=fac[0]=1;rep(i,1,sz-1) _fac[i]=inv(fac[i]=fac[i-1]*i%mod),_inv[i]=_fac[i]*fac[i-1]%mod;}

int rev[N], wn[N], lim, invlim;
int _pow(int a, int b, int ans = 1) {
    for(;b;b >>= 1, a = (u64) a * a % mod) if(b & 1)
        ans = (u64) ans * a % mod;
    return ans;
}
void init(int len) {
    lim = 2 << std::__lg(len - 1);
    invlim = mod - (mod - 1) / lim;
    for(static int i = 1;i < lim;i += i) {
        wn[i] = 1;
        const int w = _pow(3, mod / i / 2);
        for(int j = 1;j < i;++j) {
            wn[i + j] = (u64) wn[i + j - 1] * w % mod;
        }
    }
    for(int i = 1;i < lim;++i) {
        rev[i] = rev[i >> 1] >> 1 | (i % 2u * lim / 2);
    }
}
void DFT(int * a) {
    static u64 t[N];
    for(int i = 0;i < lim;++i) t[i] = a[rev[i]];
    for(int i = 1;i < lim;i += i) {
        for(int k = i & (1 << 19);k--;) 
            if(t[k] >= mod * 9ull) t[k] -= mod * 9ull;
        for(int j = 0;j < lim;j += i + i) {
            for(int k = 0;k < i;++k) {
                const u64 x = t[i + j + k] * wn[i + k] % mod;
                t[i + j + k] = t[k + j] + (mod - x), t[k + j] += x;
            }
        }
    }
    for(int i = 0;i < lim;++i) a[i] = t[i] % mod;
}
void IDFT(int * a) {
    DFT(a), std::reverse(a + 1, a + lim);
    for(int i = 0;i < lim;++i)
        a[i] = (u64) a[i] * invlim % mod;
}

struct oc {
    std::vector<int> f, g, res;
    std::vector<std::vector<int>> fa, fb;
    int n, p;
    oc(int n) : f(n), g(n), res(n), n(n), p(0) { }
    void push(int v0, int v1) {
        f[p] = v0;
        res[p] = (res[p] + (u64) f[0] * v1 + (u64) g[0] * v0) % mod;
        g[p++] = v1;
        static int A[N], B[N];
        int lb = p & -p;
        init(lb * 2);
        memset(A, 0, lim << 2);
        memset(B, 0, lim << 2);
        for(int i = 0;i < lb;++i) A[i] = g[p - lb + i], B[i] = f[p - lb + i];
        DFT(A), DFT(B);
        if(lb == p) {
            fa.emplace_back(A, A + lim);
            fb.emplace_back(B, B + lim);
            for(int i = 0;i < lim;++i) A[i] = (u64) A[i] * B[i] % mod;
        } else {
            auto & C = fb[std::__lg(lim)], & D = fa[std::__lg(lim)];
            for(int i = 0;i < lim;++i) A[i] = ((u64) A[i] * C[i * 2] + (u64) B[i] * D[i * 2]) % mod;
        }
        IDFT(A);
        for(int j = p;j < p + lb && j < n;++j) res[j] = (res[j] + A[j - p + lb]) % mod;
    }
};
struct Exp : oc {
    std::vector<int> res;
    Exp(int n) : oc(n), res(n) { }
    void push(int v) {
        if(!res[0]) return void(res[0] = 1);
        oc::push(res[p], v * u64(p + 1) % mod);
        res[p] = (u64) oc::res[p - 1] * _inv[p] % mod;
    }
};
struct Ln : oc {
    std::vector<int> res; int fi;
    Ln(int n) : oc(n), res(n), fi(0) {}
    void push(int v) {
        if(!fi) return void(fi = 1);
        oc::push(res[p] * (u64) p % mod, v);
        res[p] = ((u64) v * p + mod - oc::res[p - 1]) % mod * _inv[p] % mod;
    }
};
struct Inv : oc {
    std::vector<int>res; int fi;
    Inv(int n) : oc(n), res(n), fi(0) {}
    void push(int v) {
        if (!fi) {
            assert(v != 0);
            fi = v;
            res[0] = inv(v);
            oc::push(res[0], v);
            return;
        }
        ll t = (oc::res[p] + (u64) v * res[0]) % mod;
        res[p] = (mod - res[0] * t % mod) % mod;
        oc::push(res[p], v);
    }
};

int n;


int main() {
    file();
    _init();
    cin>>n;
    vector<int> R(n+10), U(n+10);
    Inv iU(n+10);
    Exp eR(n+10), eRU(n+10);
    oc RU(n+10), UeRU(n+10), UUeRU(n+10), _R(n+10), _U(n+10);
    rep(i,0,n) {
        iU.push(i==0?1:mod-U[i]);
        eR.push(R[i]);
        RU.push(R[i],U[i]);
        eRU.push(RU.res[i]);
        UeRU.push(U[i],eRU.res[i]);
        UUeRU.push(U[i],UeRU.res[i]);
        _R.push(iU.res[i], (mod+eR.res[i]-UUeRU.res[i])%mod);
        _U.push(iU.res[i], (mod+eR.res[i]-eRU.res[i])%mod);
        R[i+1]=_R.res[i];
        U[i+1]=_U.res[i];
    }
    cout<<(R[n]+U[n])*fac[n]%mod<<'\n';
    return 0;
}