#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:1024000000,1024000000")
const int maxn = 500005;
const int maxm = 1000005;
long long dp[40][40];
void solve() {
  int n, h;
  scanf("%d %d", &n, &h);
  memset(dp, 0, sizeof(dp));
  for (int i = 0; i <= n; i++) dp[0][i] = 0;
  for (int i = 0; i <= n; i++) dp[i][0] = 1;
  for (int k = 1; k <= n; k++) {
    for (int i = 1; i <= n; i++) {
      dp[k][i] = 0;
      for (int j = 0; j < i; j++) {
        dp[k][i] += dp[k - 1][j] * dp[k - 1][i - j - 1];
      }
    }
  }
  printf("%I64d\n", dp[n][n] - dp[h - 1][n]);
}
int main() {
  solve();
  return 0;
}
