#include <bits/stdc++.h>
using namespace std;
ifstream fin("a.in");
long long dp[36][36];
int n, h, logn[36];
int main() {
  cin >> n >> h;
  int i, j, f, l;
  for (i = 0; i < n + 1; i++) {
    logn[i] = 0;
    for (j = 0; j < n + 1; j++) dp[i][j] = 0;
  }
  dp[1][1] = 1;
  logn[1] = 1;
  dp[0][0] = 1;
  for (i = 2; i <= n; i++) {
    int k = i;
    while (k) {
      k >>= 1;
      logn[i]++;
    }
    for (j = 0; j < i; j++) {
      k = i - 1 - j;
      for (l = logn[j]; l <= j; l++) {
        for (f = logn[k]; f <= k; f++) {
          int height = 1 + (l > f ? l : f);
          dp[i][height] += dp[j][l] * dp[k][f];
        }
      }
    }
  }
  long long sumTree = 0;
  for (i = h; i <= n; i++) sumTree += dp[n][i];
  cout << sumTree;
  return 0;
}
