#include <iostream>
#include <cstdio>
using namespace std;

int n,m,ans;
const int dx[4]={-2,-1,1,2};
const int dy[4]={1,2,2,1};
void dfs(int i,int j)
{
    if (i==n && j==m)
    {
        ans++; return;
    }
    for (int k=0; k<4; k++)
    {
        int x,y;
        x=i+dx[k]; y=j+dy[k];
        if (x>=1 && x<=n && y>=1 && y<=m)
            dfs(x,y);
    }
}
int main()
{
    freopen("horse.in","r",stdin);
    freopen("horse.out","w",stdout);
    
    scanf("%d%d",&n,&m);
    dfs(1,1);
    printf("%d\n",ans);
    return 0;
}