#include<stdio.h>
#include<assert.h>
using ll=long long;
int t,n,m;
ll cnt;
struct node{
    int a,b;
    node operator+(const node&o)const{return {a+o.a,b+o.b};}
    friend node operator*(const int&o,const node&x){return {o*x.a,o*x.b};}
    int calc(int l){return a*l+b;}
};
int min(int x,int y){return x<y?x:y;}
int max(int x,int y){return x>y?x:y;}
void dfs2(node x,node y,int lim,bool flag){
    cnt+=max(min(x.a>0?(n-x.b)/x.a:0x7f7f7f7f,y.a>0?(m-y.b)/y.a:0x7f7f7f7f)-lim+1,0)+max(min(x.a>0?(m-x.b)/x.a:0x7f7f7f7f,y.a>0?(n-y.b)/y.a:0x7f7f7f7f)-lim+1,0);
    if(flag){
        for(int i=1;(x+2*i*y).calc(max(lim,i+1))<=t;++i)dfs2(x+2*i*y,y,max(lim,i+1),0);
    }if((y+2*x).calc(lim)<=t)dfs2(y+2*x,x,lim,1);
}
void dfs1(int x,int y,int lim){
    for(int tmp;x+2*lim*y<=t;tmp=x,x=y+2*x,y=tmp){
        dfs2({2*y,x},{0,y},lim,0);
        for(int i=1,nx=x+2*y;y+2*(max(i,lim)+1)*nx<=t;++i,nx+=2*y)dfs1(y+2*nx,nx,max(i,lim));
    }
}
int main(){
    scanf("%d%d",&n,&m),t=max(n,m);
    dfs1(2,1,1);
    for(int x=2,y=1;x<=t;x=y+2*x,y=(x-y)/2)cnt+=(x<=n&&y<=m)+(x<=m&&y<=n);
    printf("%lld",cnt);
    return 0;
}