//  M. Triangle Construction

#include<bits/stdc++.h>

using namespace std;

int check(int a) {

}

typedef long long ll;

int main() {

    ios::sync_with_stdio(false);

    ll a, b;
    cin >> a >> b;
    a--;
    b--;
    if (a > b)swap(a, b);


    int num = 1;
    num += (a != b);

    ll p1 = 0, p2 = 0;
    for (ll i = 1; i <= a; i++) {
        ll j = sqrt(a * a - i * i);
        for (ll k = max(1ll, j - 2); k <= j + 2 && k <= i; k++) {
            if (k * k + i * i == a * a) {
                p1 = k;
                p2 = i;
               // cout << " find in " << p1 << "," << p2 << endl;
                if (1ll*i*b/a*a == 1ll*i*b && 1ll*k*b/a*a == 1ll*k*b) {
                    num++;
                    num += (a != b);
                    if (p1 != p2) {
                        num += (a != b);
                        num ++;
                    }
                }
            }
        }
    }


    cout << num;


    return 0;
}