#include<bits/stdc++.h>
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define repp(i,j,k) for(int i=j;i>=k;i--)
#define ls(x) (x<<1)
#define rs(x) ((x<<1)|1)
#define mp make_pair
#define sec second
#define fir first
#define pii pair<int,int>
#define lowbit(i) i&-i
#define int long long
using namespace std;
typedef long long ll;
const int N=5e5+5,M=6,S=(1<<15)+5,inf=1e9+7,mo=998244353;
const double eps=1e-8;
void read(int &p){
	int x=0,w=1;
	char ch=0;
	while(!isdigit(ch)){
		if(ch=='-')w=-1;
		ch=getchar();
	}
	while(isdigit(ch)){
		x=(x<<1)+(x<<3)+ch-'0';
		ch=getchar();
	}
	p=x*w;
}
int n,m,upp;
int ans=0;
void getans(int a,int b,int c,int d,int lowv){
    int maxv=min(a?(n-b)/a:inf,c?(m-d)/c:inf);
    if(lowv&1)lowv++;
    if(maxv&1)maxv--;
    if(lowv<=maxv)ans+=((maxv-lowv)>>1)+1;
}
void dfs2(int a,int b,int c,int d,int lowv){
    getans(a,b,c,d,lowv),getans(c,d,a,b,lowv);
    for(int x=2;;x+=2){
        int na=a*x+c,nb=b*x+d,nc=a,nd=b,nlv=max(lowv,x);
        if(na*nlv+nb>upp||nc*nlv+nd>min(n,m))break;
        dfs2(na,nb,nc,nd,nlv);
    }
}
void dfs1(int a,int b,int lowv){
    for(int x=2;;x+=2){
        int na=b,nb=b*x+a,nlv=max(lowv,x+1);
        if(nb>upp||(nb*lowv+na)>upp)break;
        dfs1(na,nb,nlv);
    }
    dfs2(b,a,0,b,lowv);
}
signed main(){
    read(n),read(m),upp=max(n,m);
    dfs1(0,1,1);
    printf("%lld\n",ans);
    return 0;
}