#include <bits/stdc++.h>

typedef long long LL;

const int N = 5000 + 7;
const int MOD = 998244353;

int n;
int c[N][N], s[N][N], r[N][N];

int main() {

  scanf("%d", &n);

  for(int i = 0; i <= n; ++i)
    c[i][0] = c[i][i] = 1;
  for(int i = 1; i <= n; ++i)
    for(int j = 1; j < i; ++j)
      c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % MOD;

  s[0][0] = 1;
  for(int i = 1; i <= n; ++i)
    for(int j = 1; j <= i; ++j)
      s[i][j] = (s[i - 1][j - 1] + 1LL * j * s[i - 1][j]) % MOD;

  int p2 = 1;
  for(int i = 1; i <= n; ++i) {
    p2 = p2 * 2 % MOD;
    r[i][0] = 1;
    for(int j = 1; j <= n; ++j)
      r[i][j] = 1LL * r[i][j - 1] * (p2 + MOD - i) % MOD;
  }
  
  int ans = 1;
  for(int i = 1; i <= n; ++i)
    for(int j = 1; j <= i; ++j)
      ans = (ans + 1LL * c[n][i] * s[i][j] % MOD * r[j][n - i]) % MOD;

  printf("%d\n", ans);
  
  return 0;

}