#include <bits/stdc++.h>
using namespace std;
const int Mod = 1e9 + 7;
long long dp[45][45];
int n, h;
int main() {
  scanf("%d%d", &n, &h);
  dp[0][0] = 1;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= i; ++j)
      for (int k = 0; k <= i - 1; ++k)
        for (int l = 0; l <= j - 1; ++l) {
          dp[i][j] += dp[k][j - 1] * dp[i - k - 1][l];
          if (l <= j - 2) dp[i][j] += dp[k][j - 1] * dp[i - k - 1][l];
        }
  long long Ans = 0;
  for (int i = h; i <= n; ++i) Ans += dp[n][i];
  printf("%lld", Ans);
}
