#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

int n,m,ans;
int d[4][2]={{1,2},{2,1},{1,-2},{2,-1}};

void dfs(int x,int y)
{
    if(x==m&&y==n){++ans; return ;}
    for(int k=0;k<4;k++)
    {
        int u=x+d[k][0],v=y+d[k][1];
        if(u>=0&&u<=m&&v>=0&&v<=n){
            dfs(u,v);
        }
    }
}

int main()
{
	freopen("horse.in","r",stdin);
	freopen("horse.out","w",stdout);
    scanf("%d%d",&n,&m);
    n--,m--;
    dfs(0,0);
    printf("%d",ans);
    return 0;
}