/*
	Name:
	Date: 04/11/14 08:24
	Description:
	Analysis:
*/
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
int tot=0,ex,ey;
bool b[705][705];
int dx[15]={0,2,-2,-1,1};
int dy[15]={0,1, 1,2, 2};
struct node{
	int x,y;
};
node mpair(int x,int y)
{
	node tmp;
	tmp.x=x,tmp.y=y;
	return tmp;
}
queue<node> q;
void BFS( )
{
	while(!q.empty()){
		int x=q.front().x,y=q.front().y;
		if(x==ex && y==ey) tot++;
		q.pop();
		for(int i=1;i<=4;i++){
			if(x+dx[i]<=ex && x+dx[i]>0 && y+dy[i]>0 && y+dy[i]<=ey)
			q.push(mpair(x+dx[i],y+dy[i]));
		}
	}
}


int main()
{
	freopen("horse.in","r",stdin);
	freopen("horse.out","w",stdout);
		scanf("%d%d",&ex,&ey);
		q.push(mpair(1,1));
		BFS();
		printf("%d",tot);
	fclose(stdin);
	fclose(stdout);
	//while(1);
	return 0;
}