#include<cstdio>
#include<iostream>
#include<string>
using namespace std;
typedef long long LL;
int n,m,mi,ma;
int tot=0,s[(1<<12)+1][2];
LL dp[41][(1<<12)+1],ans=0;
void dfs(int l,int now,int pre)  
{  
    if(l>mi)return;  
    if(l==mi)  
    {  
        s[tot][0]=pre;  
        s[tot++][1]=now;  
        return ;      
    }  
    dfs(l+2,(now<<2)|3,(pre<<2)|3);  
    dfs(l+1,(now<<1)|1,pre<<1);  
    dfs(l+1,now<<1,(pre<<1)|1);  
}  
int main()
{
	freopen("floor.in","r",stdin);
	freopen("floor.out","w",stdout);
	scanf("%d%d",&n,&m);
	mi=min(m,n);//行
	ma=max(m,n);//列
	dfs(0,0,0);
	int fuck=(1<<mi);
	dp[0][fuck-1]=1;  
	for(int i=0;i<ma;++i)  
	{  
		for(int j=0;j<tot;++j)  
		{  
			dp[i+1][s[j][1]]+=dp[i][s[j][0]];  
		}  
	}  
	cout<<dp[ma][fuck-1];
	return 0;
}