#include <bits/stdc++.h>
using namespace std;
template <class T>
T MAX(T a, T b) {
  return a > b ? a : b;
}
template <class T>
T MIN(T a, T b) {
  return a < b ? a : b;
}
template <class T1>
void __(T1 p) {
  cout << p << endl;
}
template <class T1>
void deb(T1 p) {
  cout << "Debugging: " << p << endl;
}
template <class T1, class T2>
void deb(T1 p, T2 q) {
  cout << "Debugging: " << p << "\t" << q << endl;
}
template <class T1, class T2, class T3>
void deb(T1 p, T2 q, T3 r) {
  cout << "Debugging: " << p << "\t " << q << "\t " << r << endl;
}
template <class T1, class T2, class T3, class T4>
void deb(T1 p, T2 q, T3 r, T4 s) {
  cout << "Debugging: " << p << "\t " << q << "\t " << r << "\t " << s << endl;
}
unsigned long long int POOW(unsigned long long b, unsigned long long p) {
  if (p == 0) return 1;
  return b * POOW(b, p - 1);
}
const int first[] = {0, 0, 1, -1, -1, 1, -1, 1};
const int second[] = {1, -1, 0, 0, 1, 1, -1, -1};
const int kx[] = {-2, -1, 1, 2, 2, 1, -1, -2};
const int ky[] = {1, 2, 2, 1, -1, -2, -2, -1};
unsigned long long ans[40][40], a, b, c, d;
bool flag[40][40];
unsigned long long GO(int n, int h) {
  if (n == 0 and h == 0) return 1;
  if (flag[n][h]) return ans[n][h];
  unsigned long long &sum = ans[n][h];
  flag[n][h] = 1;
  sum = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= h - 1; j++) {
      sum = sum + GO(i - 1, h - 1) * GO(n - i, j);
    }
    for (int j = 0; j <= h - 2; j++) {
      sum = sum + GO(i - 1, j) * GO(n - i, h - 1);
    }
  }
  return sum;
}
int main() {
  int i, t, j, k, l, keis(0), n, h;
  scanf("%d", &n);
  scanf("%d", &h);
  memset(flag, 0x00, sizeof flag);
  ans[0][0] = 1;
  flag[0][0] = 1;
  ans[1][0] = ans[0][1] = 0;
  a = 0;
  for (i = h; i <= n; i++) a += GO(n, i);
  __(a);
  return 0;
}
