#include<bits/stdc++.h>
#define itn int
using namespace std;
int ax[4]={2,1,-1,-2},ay[4]={1,2,2,1},ans,n,m,ma[1005][1005];
void dfs(int x,int y)
{
	if(x==n-1&&y==m-1)
	{
		ans++;
		return ;
	}
	for(itn k=0;k<4;k++)
	{
		int i = x+ax[k];
		int j = y+ay[k];
		if(i>=0&&i<=n-1&&j>=0&&j<=m-1)
		{
			dfs(i,j);
		}
		
	}
}
int main()
{
	freopen("horse.in","r",stdin);
	freopen("horse.out","w",stdout);
	cin>>n>>m;
	dfs(0,0);
	cout<<ans;
	return 0;
}