#include<iostream>
#include<queue>
#include<cstdio>
#include<cstring>
using namespace std;
int n,m;
int dx[]={-2,-1,1,2};
int dy[]={1,2,2,1};
queue <int> qx;
queue <int> qy;
queue <long long> bs;
long long f[21][21];
void bfs()
{
	qx.push(1);
	qy.push(1);
	bs.push(1);
	while(!qx.empty())
	{
		int tx=qx.front();
		int ty=qy.front();
		int tbs=bs.front();
		for(int i=0;i<4;i++)
		{
			int nowx=tx+dx[i];
			int nowy=ty+dy[i];
			if(nowx>=1&&nowx<=n&&nowy>=1&&nowy<=m)
			{
				f[nowx][nowy]+=tbs;
				qx.push(nowx);
				qy.push(nowy);
				bs.push(tbs);
			}
		}
		qx.pop();
		qy.pop();
		bs.pop();
	}
}
int main()
{
	freopen("horse.in","r",stdin);
	freopen("horse.out","w",stdout);
	scanf("%d%d",&n,&m);
	bfs();
	printf("%lld",f[n][m]);
	fclose(stdin);
	fclose(stdout);
	return 0;
}