#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef pair<int,int> pii;
const int N=2e5+5;
int n,m,k,K;
inline bool Check(int x,int y){return 1<=x&&x<=k&&1<=y&&y<=k&&(y>=2*x||x>=2*y);}
signed main(){
    // freopen("ex_4.in","r",stdin);
    // freopen(".out","w",stdout);
    std::ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    cin>>n>>m,k=min(n,m),K=max(n,m);
    queue<pii>q;
    q.push(pii(1,2));
    int Ans=0;
    while(!q.empty()){
        Ans+=2;
        pii u=q.front();q.pop();
        int x=u.fi,y=u.se,tx,ty,g;
        tx=x,ty=y+x*2,g=__gcd(tx,ty),tx/=g,ty/=g;
        if(Check(tx,ty))q.push(pii(tx,ty));
        else if(y+x*2>k)Ans+=(K-y)/(x*2);
        tx=x+y*2,ty=y,g=__gcd(tx,ty),tx/=g,ty/=g;
        if(Check(tx,ty))q.push(pii(tx,ty));
        else if(x+y*2>k)Ans+=(K-x)/(y*2);
    }
    cout<<Ans;
    return 0;
}