#include <bits/stdc++.h>
#define ull unsigned long long
using namespace std;

ull p=998244353;
unordered_map<ull,int> book;
int n,m,sum=0;

inline ull h(pair<int,int> x){
	return (ull)x.first*p+x.second;
}

bool dfs(int x,int y){
	if(x>max(n,m) || y>max(n,m)) return 1;
	if(x<2*y && y<2*x) return 0;
	if(book[h(make_pair(x,y))]) return book[h(make_pair(x,y))]-1;
//	cout<<x<<' '<<y<<'\n';
	bool res=1;
	book[h(make_pair(x,y))]=2;
	res&=dfs(y,x);
	if(!res) return (book[h(make_pair(x,y))]=1)-1;
	res&=dfs(x+2*y,y);
	if(!res) return (book[h(make_pair(x,y))]=1)-1;
	if(x>2*y) res&=dfs(x-2*y,y);
	sum+=(res && x<=n && y<=m);
	return (book[h(make_pair(x,y))]=res+1)-1;
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	cin>>n>>m;
	n=dfs(1,2);
	cout<<sum;
	return 0;
}