#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int dx[5]={0,1,2,1,2},dy[5]={0,2,1,-2,-1};
int n,m,ans;
inline void dfs(int x,int y)
{
	int i;
	if ((x==m)&&(y==n))
	  {
	    ans++;
	    return;
      }
	for (i=1;i<=4;++i)
	  if ((x+dx[i]<=m)&&(x+dx[i]>=1)&&(y+dy[i]<=n)&&(y+dy[i]>=1))
	  {
	    dfs(x+dx[i],y+dy[i]);
	  }
}
int main()
{
	freopen("horse.in","r",stdin);
	freopen("horse.out","w",stdout);
	scanf("%d%d",&n,&m); ans=0;
	dfs(1,1);
	cout<<ans<<endl;
	fclose(stdin);
	fclose(stdout);
}