//A tree without skin will surely die.
//A man without face will be alive.
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for (int i=j;i<=k;++i)
#define per(i,j,k) for (int i=j;i>=k;--i)
int n,m,ans;
inline void dfs(int x,int y,int fm);
inline void add(int x,int y,int fm){
    if (fm==1 && (x>n || y>m)) return;
    if (x<=n && y<=m) dfs(x,y,fm);
    else if (y<=n && x<=m) dfs(y,x,1);
}
inline void dfs(int x,int y,int fm){
    ++ans;
    if (fm!=1) add(y,x,1);
    if (fm!=3) add(x+y+y,y,2);
    if (x>2*y){
        if (fm!=2) add(x-y-y,y,3);
    }
}
inline void solve(){
    cin>>n>>m,dfs(1,2,-1);
    cout<<ans<<'\n';
}
signed main(){
    // freopen("test.in","r",stdin);
    // freopen("test.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int t=1;
    // cin>>t;
    while (t--) solve();
    return 0;
}