#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
using namespace std;
int n,m;
unordered_map<ll,bool>g;
inline ll H(int a,int b){return 10000000ll*a+b;}
signed main(){
	#ifndef ONLINE_JUDGE
	freopen("ex_3.in","r",stdin);
	#endif
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n>>m;int ans=0;
	assert(n<=100000&&m<=100000);
	queue<pair<int,int>>q;
	q.push({1,2}),g[H(1,2)]=1;
	q.push({2,1}),g[H(2,1)]=1;
	ans=2;
	while(!q.empty()){
		int a=q.front().first,b=q.front().second;q.pop();
		a+=b*2;
		while(max(a,b)<=max(n,m)){
			if(a<=n&&b<=m&&g.find(H(a,b))==g.end())ans++,g[H(a,b)]=1;
			if(b<=n&&a<=m&&g.find(H(b,a))==g.end())ans++,g[H(b,a)]=1,q.push({b,a});
			a+=b*2;
		}
	}
	cout<<ans<<endl;
	return 0;
}