#include <bits/stdc++.h>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
using namespace std;
using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define ll long long 
#define P pair<ll,ll>
const ll inf=1LL << 60;
int main(){
  ll n;
  cin >> n;
  ll ans=0;
  n*=n;
  for(ll x=1;x*x<=n;x++){
    ll y=n-x*x;
    if(y==0)continue;
    ll q=sqrt(y);
    ll p=q*q;
    if(p==y){
      ans++;
      //cout << x << " ";
    }
  }
  cout<< ans;
    
}