#include <cstdio>
int a[50][50], n, m;
int foo(int i, int j)
{

  int q = 0, i1, j1;

  if (i > n)
  {
    i = 1;
    j++;

    if (j == m + 1)
      return 1;
  }

  if (!(a[i - 1][j] == 1 && a[i][j - 1] == 1 && a[i - 1][j - 1] == 1))
  {
    a[i][j] = 1;
    q = foo(i + 1, j);
  }
  if (!(a[i - 1][j] == 2 && a[i][j - 1] == 2 && a[i - 1][j - 1] == 2))
  {
    a[i][j] = 2;
    q += foo(i + 1, j);
  }
  return q;
}
int main()
{
  freopen("nice.in", "r", stdin);
  freopen("nice.out", "w", stdout);
  scanf("%d%d", &n, &m);
  printf("%d \n", foo(1, 1));
  return 0;
}