#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int n,m;ll ans;
int fdiv(int p,int q){if(!q)return 2e9;return (p+(p<0))/q-(p<0);}
void dfs1(int a,int b,int c,int d,int u,int lst,bool flg=0)
{//printf("dfs1(%du+%d,%du+%d,%d,%d,%d)\n",a,b,c,d,u,lst,flg);
	if(1ll*a*u+b>n||1ll*c*u+d>m)return;
	int mu=min(fdiv(n-b,a),fdiv(m-d,c)),nu=fdiv(n-d,c);
	ans+=max(0,mu-u+1)+max(0,nu-u+1);
	// printf("ans:%lld\n",ans);
	if(!flg)dfs1(a,b,c+2*a,d+2*b,max(lst+1,u),lst+1);
	dfs1(c,d,2*c+a,2*d+b,u,0);
}
void dfs2(int a,int b,int u,int lst)
{//printf("dfs2(%d/%d,%d,%d)\n",a,b,u,lst);
	if(a>n||b>m||b+2ll*u*a>m)return;
	if(!lst)dfs1(0,a,2*a,b,u,0,1);
	dfs2(a,2*a+b,max(u,lst+2),lst+1);
	dfs2(b,2*b+a,u,0);
}
void dfs3(int a,int b)
{
	if(a>n||b>m)return;
	if(b<=n)ans+=2;else ans+=1;
	dfs3(b,2*b+a);
}
int main()
{
	scanf("%d%d",&n,&m);
	if(n>m)swap(n,m);
	dfs2(1,2,1,0);dfs3(1,2);
	printf("%lld\n",ans);
	fclose(stdin);fclose(stdout);return 0;
}