#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
int n,m,a[30][30],Next[4][2]={{-2,1},{-1,2},{1,2},{2,1}};
void dfs(int x,int y)
{
	int tx,ty,i,j;
	for(int i=0;i<=3;i++)
	{
		tx=x+Next[i][0];
		ty=y+Next[i][1];
		if(tx<1 || tx>n || ty<1 || ty>m)
			continue;
		a[tx][ty]++;
		dfs(tx,ty);
	}
}
int main()
{
	freopen("horse.in","r",stdin);
	freopen("horse.out","w",stdout);
	memset(a,0,sizeof(a));
	cin>>n>>m;
	dfs(1,1);
	cout<<a[n][m]<<endl;
	return 0;
}