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