#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define inf 0x3f3f3f3f
#define infl 0x3f3f3f3f3f3f3f3f

#define all(x) (x).begin(),(x).end()

struct { template<class T> operator T() { int x; cin >> x; return x; } } in;

ll cnt=0;
int n,m;

bool feasible(ll a, ll b, ll c, ll d, ll x) {
        return a+c*x<=n && b+d*x<=m;
}

ll cc=0;
void solve_x(int a, int b, int c, int d, int mx) {
        if(!feasible(a,b,c,d,mx)) return;
        // (a+cx) / (b+dx)
        cc++;
        ll delta = 0;
        if(c) delta += min((n-a)/c/2, (m-b)/d/2) - mx/2 + 1;
        else delta += (m-b)/d/2 - mx/2 + 1;
        //printf("\t%lld + %lld x / %lld + %lld x | %lld | %lld\n",a,c,b,d,mx,delta);
        cnt+=max(0ll,delta); delta = 0;
        if(c) delta += min((n-b)/d/2, (m-a)/c/2) - mx/2 + 1;
        else delta += (n-b)/d/2 - mx/2 + 1;
        //printf("\t%lld + %lld x / %lld + %lld x | %lld | %lld\n",a,c,b,d,mx,delta);
        cnt+=max(0ll,delta); delta = 0;
        for(int u=2; feasible(b,a+1ll*u*b,d,c+1ll*u*d,max(mx,u)); u+=2) {
                //printf("s2->s2 %d %d / %d %d -> %d %d / %d %d\n",a,c,b,d,b,d,a+u*b,c+u*d);
                solve_x(b, a+u*b, d, c+u*d, max(mx,u));
        }
}

void solve(int a, int b, int mx) {
        if(!feasible(b,a,0,b,mx)) return;
        // a / b
        for(int u=2; feasible(a+1ll*u*b,b,0,a+1ll*u*b,max(mx,u)); u+=2) {
                solve(b, a + u * b, max(mx, u));
                //printf("s1->s1 %d / %d to %d / %d\n", a, b, b, a+u*b);
        }
        //printf("s1->s2 %d %d to %d %d / %d %d\n",a,b,b,0,a,b);
        solve_x(b, a, 0, b, mx+2);
}

int main()
{
        n=in, m=in;
        if(n>m)swap(n,m);
        // n <= m

        //solve(1,0,0);
        //printf("<1---\n");
        solve(0,1,0);
        //swap(n,m);
        //printf(">1---\n");
        //solve(0,1,0);

        printf("%lld\n",cnt);
        cerr<<cc<<endl;
}