#include <bits/stdc++.h>
std::mt19937_64 rng(
    std::chrono::steady_clock::now().time_since_epoch().count());
using namespace std;
long long dp[100][100];
long long h;
long long solve(long long n, long long dep) {
  if (dep > n) return 0;
  if (n == 0 or n == 1) {
    if (dep == n)
      return 1;
    else
      return 0;
  }
  if (dp[n][dep] != -1) return dp[n][dep];
  long long ans = 0;
  for (long long i = 1; i <= n; i++) {
    for (long long k = 0; k <= dep - 1; k++) {
      ans += solve(i - 1, k) * solve(n - i, dep - 1);
      if (k != dep - 1) ans += solve(i - 1, dep - 1) * solve(n - i, k);
    }
  }
  dp[n][dep] = ans;
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) {
    long long n;
    cin >> n >> h;
    memset(dp, -1, sizeof(dp));
    long long ans = 0;
    for (long long i = h; i <= n; i++) ans += solve(n, i);
    cout << ans;
  }
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
