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

int n,m,cnt,f[21][21];
const int dx[4]={1,1,2,2};
const int dy[4]={-2,2,-1,1};
void dfs(int i,int j)
{
    if(i<=0 || j<=0 || i>n || j>m) return;
    if(i==n && j==m)
    {
        cnt++;
        return;
    }
    int x,y;
    for(int ii=0;ii<4;ii++)
    {
        x=i+dx[ii];y=j+dy[ii];
        dfs(x,y);
    }
}
int main()
{
    freopen("horse.in","r",stdin);
    freopen("horse.out","w",stdout);
    
    cin>>m>>n;
    
    dfs(1,1);
    
    cout<<cnt<<endl;
    return 0;
}