#include<bits/stdc++.h>
using namespace std;
vector<pair<int,int>>vec1,vec2;
int n,m,ans;long long n2,m2;
int main(){
    scanf("%d%d",&n,&m);n--;m--;
    n2=1ll*n*n;m2=1ll*m*m;
    for (int i=1;i<n;i++){
        int j=sqrt(n2-1ll*i*i);
        if (1ll*i*i+1ll*j*j==n2)
            vec1.emplace_back(i,j);
    }
    for (int i=1;i<m;i++){
        int j=sqrt(m2-1ll*i*i);
        if (1ll*i*i+1ll*j*j==m2)
            vec2.emplace_back(i,j);
    }
    while (!vec1.empty()&&!vec2.empty()){
        long long res1=1ll*vec1.back().first*vec2.back().second,
                  res2=1ll*vec2.back().first*vec1.back().second;
        if (res1>res2) vec1.pop_back();
        else if (res1<res2) vec2.pop_back();
        else ans++,vec1.pop_back(),vec2.pop_back();
    }
    printf("%d\n",n==m?ans+1:ans+1<<1);
    return 0;
}