#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
using namespace std; bool MEM;
using ll=long long; using ld=long double;
using pii=pair<int,int>; using pll=pair<ll,ll>;
const int I=1e9;
const ll J=1e18;
int n,m,mm;
ll ans;
ll cal(int xa,int ya,int xb,int yb,int mx) {
	ll mn=min(xa?(n-ya)/xa:J,xb?(m-yb)/xb:J);
	return mx<=mn?(mn-mx+2)>>1:0; 
}
void dfs2(int xa,int ya,int xb,int yb,int mx) {
	ans+=cal(xa,ya,xb,yb,mx)+cal(xb,yb,xa,ya,mx);
	for (int x=2;;x+=2) {
		int nxa=xb,nya=yb,nxb=xb*x+xa,nyb=yb*x+ya,nx=max(mx,x);
		if ((ll)nxb*mx+nyb>m) break;
		dfs2(nxa,nya,nxb,nyb,nx);
	}
}
void dfs1(int a,int b,int mx) {
	dfs2(0,b,b,a,mx);
	for (int x=2;;x+=2) {
		int na=b,nb=b*x+a,nx=max(mx,x+2);
		if (nb*nx+na>m) break;
		dfs1(na,nb,nx);
	}
}
void mian() {
	scanf("%d%d",&n,&m);
	if (n>m) swap(n,m);
	dfs1(0,1,2);
	cout<<ans;
}
bool ORY; int main() {
//	while (1)
//	int t; for (scanf("%d",&t);t--;)
	mian();
	cerr<<"\n"<<abs(&MEM-&ORY)/1048576<<"MB";
	return 0;
}