#include <iostream>

using namespace std;
using ll = long long;
const int MX = 400010;
ll f[MX],inv[MX],fi[MX];
constexpr ll mod = 998244353;
void solve(){
    inv[1] = 1;
    for(int i=2;i<MX;i++){
        inv[i] = mod - (mod/i)*inv[mod%i]%mod;
    }
    f[0] = fi[0] = 1;
    for(int i=1;i<MX;i++){
        f[i] = f[i-1]*i%mod;
        fi[i] = fi[i-1]*inv[i]%mod;
    }
}

ll nck(ll n, ll k){
    if(n<0 || k<0 || n<k) return 0;
    return f[n]*fi[k]%mod*fi[n-k]%mod;
}

ll pw(ll a,ll x){
    a %= mod;
    ll ret = 1;
    while(x){
        if(x&1) (ret *= a) %= mod;
        (a *= a) %= mod; x /= 2;
    }
    return ret;
}

ll dp[5010][5010];
int main(){
    int i,j,n; cin >> n;
    solve();
    dp[0][0] = 1;
    for(i=0;i<=n;i++){
        for(j=0;j<=n;j++){
            if(i && j) dp[i][j] += dp[i - 1][j - 1];
            if(i) dp[i][j] += dp[i - 1][j]*j;
            dp[i][j] %= mod;
        }
    }
    ll ans = 1;
    for(i=1;i<=n;i++){
        for(j=1;j<=i;j++){
            ll val = dp[i][j]*nck(n,i)%mod;
            //ll val = nck(n,i)*nck(i - 1,i - j)%mod*nck(i,j)%mod;
            (val *= pw(pw(2,j) - j + mod,n - i)) %= mod;
            (ans += val) %= mod;
            //cout << i << " " << j << " " << val << "\n";
        }
    }
    cout << ans << "\n";
}