#include <bits/stdc++.h>
using namespace std;
const int N = 5050;
long long f[36][37];
int n, h;
int main() {
  cin >> n >> h;
  for (int i = 0; i <= 35; ++i) {
    f[0][i] = 1;
  }
  for (int i = 1; i <= 35; ++i) {
    for (int j = 1; j <= 35; ++j) {
      for (int k = 0; k < i; ++k) {
        f[i][j] += f[k][j - 1] * f[i - k - 1][j - 1];
      }
    }
  }
  cout << f[n][n] - f[n][h - 1] << endl;
  return 0;
}
