#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const int M=998244353;
namespace fft{
    struct num{
        double x,y;
        num() {x=y=0;}
        num(double x,double y):x(x),y(y){}
    };
    inline num operator+(num a,num b){return num(a.x+b.x,a.y+b.y);}
    inline num operator-(num a,num b){return num(a.x-b.x,a.y-b.y);}
    inline num operator*(num a,num b){return num(a.x*b.x-a.y*b.y,a.x*b.y+a.y*b.x);}
    inline num conj(num a){return num(a.x,-a.y);}
    int base=1;
    vector<num> roots={{0,0},{1,0}};
    vector<int> rev={0,1};
    const double PI=acosl(-1.0);
    void ensure_base(int nbase){
        if (nbase<=base) return;
        rev.resize(1<<nbase);
        for (int i=0;i<(1<<nbase);i++)
            rev[i]=(rev[i>>1]>>1)+((i&1)<<(nbase-1));
        roots.resize(1<<nbase);
        while (base<nbase){
            double angle=2*PI/(1<<(base+1));
            for (int i=1<<(base-1);i<(1<<base);i++){
                roots[i<<1]=roots[i];
                double angle_i=angle*(2*i+1-(1<<base));
                roots[(i<<1)+1]=num(cos(angle_i),sin(angle_i));
            }
            base++;
        }
    }
    void fft(vector<num> &a,int n=-1){
        if (n==-1) n=a.size();
        assert((n&(n-1))==0);
        int zeros=__builtin_ctz(n);
        ensure_base(zeros);
        int shift=base-zeros;
        for (int i=0;i<n;i++)
            if (i<(rev[i]>>shift))
                swap(a[i],a[rev[i]>>shift]);
        for (int k=1;k<n;k<<=1)
            for (int i=0;i<n;i+=2*k)
                for (int j=0;j<k;j++){
                    num z=a[i+j+k]*roots[j+k];
                    a[i+j+k]=a[i+j]-z;
                    a[i+j]=a[i+j]+z;
                }
    }
    vector<num> fa,fb;
    vector<int> multiply_mod(vector<int> &a,vector<int> &b,int m,int eq=0){
        int need=a.size()+b.size()-1;
        int nbase=0;
        while ((1<<nbase)<need) nbase++;
        ensure_base(nbase);
        int sz=1<<nbase;
        if (sz>(int)fa.size()) fa.resize(sz);
        for (int i=0;i<(int)a.size();i++){
            int x=(a[i]%m+m)%m;
            fa[i]=num(x&((1<<15)-1),x>>15);
        }
        fill(fa.begin()+a.size(),fa.begin()+sz,num{0,0});
        fft(fa,sz);
        if (sz>(int)fb.size()) fb.resize(sz);
        if (eq) copy(fa.begin(),fa.begin()+sz,fb.begin());
        else {
            for (int i=0;i<(int)b.size();i++){
                int x=(b[i]%m+m)%m;
                fb[i]=num(x&((1<<15)-1),x>>15);
            }
            fill(fb.begin()+b.size(),fb.begin()+sz,num{0,0});
            fft(fb,sz);
        }
        double ratio=0.25/sz;
        num r2(0,-1),r3(ratio,0),r4(0,-ratio),r5(0,1);
        for (int i=0;i<=(sz>>1);i++){
            int j=(sz-i)&(sz-1);
            num a1=(fa[i]+conj(fa[j]));
            num a2=(fa[i]-conj(fa[j]))*r2;
            num b1=(fb[i]+conj(fb[j]))*r3;
            num b2=(fb[i]-conj(fb[j]))*r4;
            if (i!=j){
                num c1=(fa[j]+conj(fa[i]));
                num c2=(fa[j]-conj(fa[i]))*r2;
                num d1=(fb[j]+conj(fb[i]))*r3;
                num d2=(fb[j]-conj(fb[i]))*r4;
                fa[i]=c1*d1+c2*d2*r5;
                fb[i]=c1*d2+c2*d1;
            }
            fa[j]=a1*b1+a2*b2*r5;
            fb[j]=a1*b2+a2*b1;
        }
        fft(fa,sz); fft(fb,sz);
        vector<int> res(need);
        for (int i=0;i<need;i++){
            ll aa=fa[i].x+0.5;
            ll bb=fb[i].x+0.5;
            ll cc=fa[i].y+0.5;
            res[i]=(aa+((bb%m)<<15)+((cc%m)<<30))%m;
        }
        return res;
    }
}
const int maxn=1e5+10;
int f[maxn],nf[maxn],p2[maxn],inv_p2[maxn],inv[maxn];
int dp[maxn];
void add(int &x,int y){x+=y;if (x>=M)x-=M;}
void init(){
    inv[1]=1; for (int i=2;i<maxn;i++) inv[i]=M-1ll*(M/i)*inv[M%i]%M;
    nf[0]=f[0]=1; for (int i=1;i<maxn;i++) f[i]=1ll*f[i-1]*i%M,nf[i]=1ll*nf[i-1]*inv[i]%M;
    p2[0]=inv_p2[0]=1; for (int i=1;i<maxn;i++) p2[i]=1ll*p2[i-1]*2%M,inv_p2[i]=1ll*inv_p2[i-1]*inv[2]%M;
}
void solve(int l,int r){
    if (l==r){
        dp[l]=(1ll*dp[l]*f[l]+p2[l]-1)%M*inv_p2[l]%M;
        return;
    }
    int mid=(l+r)>>1;
    solve(l,mid);
    vi A(mid-l+1),B(r-l+1);
    for (int i=l;i<=mid;i++) A[i-l]=1ll*dp[i]*nf[i]%M;
    for (int i=0;i<=r-l;i++) B[i]=nf[i];
    vi C=fft::multiply_mod(A,B,M);
    for (int i=mid+1;i<=r;i++) add(dp[i],C[i-l]);
    solve(mid+1,r);
}
int main(){
    int n; cin >> n;
    init(); solve(0,n);
    cout << dp[n] << endl;
}