#include<bits/stdc++.h>
using namespace std;
long long ans=0;
int dx[4]={1,2,2,1};
int dy[4]={2,1,-1,-2};
int n,m;
void dfs(int x,int y){
	if(x==n and y==m){
		ans++;
		return;
	}
	for(int i=0;i<4;i++){
		int xx=x+dx[i];
		int yy=y+dy[i];
		if( xx<=m and 0<=yy and yy<=n){
			dfs(xx,yy);
		}
	}
	return;
}
int main(){
	cin>>n>>m;
	dfs(0,0);
	cout<<ans<<endl;
	return 0;
}

40pts WA on t2,3,4