//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;
struct node{int x,y,fm;};queue<node>q;
inline void add(int x,int y,int fm){
    if ((x<=n && y<=m) || (y<=n && x<=m));
    else return;
    if (x<=n && y<=m) ++ans;
    q.push({x,y,fm});
}
inline void solve(){
    cin>>n>>m;
    q.push((node){1,2,-1}),++ans;
    while (!q.empty()){
        int x=q.front().x,y=q.front().y,fm=q.front().fm;q.pop();
        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);
        }
    }
    cout<<ans<<'\n';
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int t=1;
    // cin>>t;
    while (t--) solve();
    return 0;
}