#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define LOCAL 0
#define open_file if(LOCAL) {freopen("fraction.in","r",stdin);freopen("fraction.out","w",stdout);}
using ll=long long;
const int MAXN=8e3+50;
const int N=8e3;
bool f[MAXN][MAXN];
void init() {
    f[0][1]=true;
    rep(x,1,N) {
        rep(y,2*x,N) {
            int p=x,q=y-2*x;
            if(p>q) swap(p,q);
            f[x][y]=f[p][q];
        }
    }
    rep(x,1,N) 
        rep(y,1,N) f[x][y]|=f[y][x];
}
void sol() {
    int n,m;scanf("%d%d",&n,&m);
    ll ans=0;
    rep(x,1,n)
        rep(y,1,m) if(f[x][y])  
            ans++;
    printf("%lld",ans);
}
int main() {
    open_file 
    init() ;
    sol() ;
    return 0;
}