// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;
#define int long long
int n,m; long long ans=0,ans1=0;
bool valid(int x, int y){
	if(x/y==0)return valid(y,x);
	if(y<1||x<2*y)return false;
	if(y==1)return (x%2==0);
	return valid(x%(2*y),y);
}
void dfs(int x, int y, bool flag){
	//if(y==1){ans+=(x%2==0);return;}
	if(max(x,y)>max(n,m))return;	
	if(x<=n&&y<=m)ans1++;
	dfs(x+y*2,y,true);
	if(flag)dfs(y,x,false);
}
inline void dfs2(int a, int b, int c, int d, int k){
	int x=(n-b)/a;
	int y=n;
	if(c!=0)y=(m-d)/c;
	ans+=max(0LL,min(x,y)-k+1)+max(0LL,(m-b)/a-k+1);
	int ptr=1;
	while(true){
		int num=2*a*ptr+c;
		int denom=2*b*ptr+d;
		if(1ll*num*max(k,ptr+1)+denom>n){
			break;
		}
		dfs2(num,denom,a,b,max(k,ptr+1));
		ptr++;
	}
}
inline void dfs1(int a, int b, int c){
	for(int i=1;;i++){
		int d=2*i*a+b;
		if(2*d*max(i,c)+a>n)break;
		dfs1(d,a,max(i,c));
	}
	dfs2(2*a,b,0,a,c);
}
signed main() {
	//just brute force simulation
	//find sols for (ax+b)/(cx+d)
	cin >> n >> m;
	if(n<m)swap(n,m);
	for(int i=1;4*i+i<n;i++){
		dfs1(2*i,1,i);
	}
	dfs2(2,0,0,1,1);
	//dfs(1,2,true);
	//cout << ans1 <<"\n";
	cout << ans << "\n";
}