#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<queue>
#include<vector>
#include<set>
using namespace std;
int a,b,c,d;
int hash1[3000010],ans;
int main()
{
      while(scanf("%d%d%d%d",&a,&b,&c,&d)!=EOF)
      {
            ans=0;
            memset(hash1,0,sizeof(hash1));
            if((a>0&&b>0&&c>0&&d>0)||(a<0&&b<0&&c<0&&d<0))
            {
                  printf("0\n");
                  continue;
            }
            for(int x1=1;x1<101;x1++)
                  for(int x2=1;x2<101;x2++)
                        hash1[a*x1*x1+b*x2*x2+2000000]++;
            for(int x3=1;x3<101;x3++)
                  for(int x4=1;x4<101;x4++)
                        ans+=hash1[2000000-c*x3*x3-d*x4*x4];
            ans=ans*16;
            printf("%d\n",ans);
      }
      return 0;
}