#include <bits/stdc++.h>

using namespace std;

typedef long long LL;

int n, m;
LL ans;

inline void DFS1(int a, int b)
{
    if(a > n || b > n) return ;
    ans += (a <= m) + (b <= m);
    DFS1(a, a * 2 + b), DFS1(b, a + b * 2);
}
inline bool DFS(int a, int b, int c, int d, int k)
{
    // printf("#%d %d %d %d %d\n", a, b, c, d, k);
    LL up = 1LL * a * k + b, down = 1LL * c * k + d;
    if(up > n || down > n || (up > m && down > m)) return 0;
    if(a || c)
    {
        if(a && c)
        {
            if(down <= m) ans += min((n - up) / a, (m - down) / c) + 1;
            if(up <= m) ans += min((m - up) / a, (n - down) / c) + 1;
        }
        else if(a)
        {
            if(down <= m) ans += (n - up) / a + 1;
            if(up <= m) ans += (m - up) / a + 1;
        }
        else
        {
            if(up <= m) ans += (n - down) / c + 1;
            if(down <= m) ans += (m - down) / c + 1;
        }
        // printf("!%d %d %d %d %d %lld\n", a, b, c, d, k, ans);

        for(int i = 1; DFS(c, d, a + 2 * c * i, b + 2 * d * i, max(k, i)); i ++ ) ;
    }
    else
    {
        if(!DFS(0, d, 2 * d, b, k)) return 0;
        for(int i = 1; DFS(0, d, 0, b + 2 * d * i, max(k, i + 1)); i ++ ) ;
    }
    return 1;
}

int main()
{
    scanf("%d%d", &n, &m);
    if(n < m) swap(n, m);
    // DFS1(1, 2);
    for(int i = 1; i <= n / 2; i ++ ) DFS(0, 1, 0, i * 2, i + 1);
    DFS(0, 1, 2, 0, 1);
    printf("%lld\n", ans);
    return 0;
}