#include <bits/stdc++.h>
using namespace std;
long long dp[40][40];
int n, h, sum[40];
int main() {
  for (int i = 1; i <= 35; i++) sum[i] = sum[i - 1] + i;
  scanf("%d%d", &n, &h);
  dp[0][0] = dp[1][1] = 1;
  for (int cnt = 2; cnt <= n; cnt++) {
    for (int i = 1; i <= cnt; i++) {
      for (int j = 0; j <= i - 1; j++)
        for (int k = 0; k <= cnt - i; k++)
          dp[cnt][max(j, k) + 1] += dp[i - 1][j] * dp[cnt - i][k];
    }
  }
  long long ans = 0;
  for (int i = h; i <= n; i++) ans += dp[n][i];
  printf("%I64d\n", ans);
  return 0;
}
