#pragma GCC optimize(3)
#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
#define ll long long
//#define ull unsigned int
//#define lll __int128
//#define double long double
using namespace std;
const long long INF=1e9+5;
//const long long mod=998244353,orm=3;
//const long long mod=1000000007;
const int MAXN=200005;
const double eps=1e-6;
//bool ST;
int n,m,ans=0;
void solve() {
	cin>>n>>m;
	if(n<m) swap(n,m);
	queue<pair<int,int> > q;
	q.push({1,2});ans=2;
	while(!q.empty()) {
		auto p=q.front();q.pop();int x=p.first,y=p.second,fg=0,fg2=0;
		if(x<=n&&y+2*x<=m) fg=1,ans++,q.push({x,y+2*x});
		if(y<=n&&x+2*y<=m) fg2=1,ans++,q.push({y,x+2*y});
		if(x<=m&&y+2*x<=n) {
			ans++;
			if(!fg) q.push({y+2*x,x});
		}
		if(y<=m&&x+2*y<=n) {
			ans++;
			if(!fg2) q.push({x+2*y,y});
		}
	}
	cout<<ans;
}
signed main() {
//	cout<<(&ST-&ED)/1024.0/1024.0;
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	solve();
	return 0;
}