#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll=long long;
using Graph=vector<vector<int>>;
#define MAX 1000000
#define MOD 1000000007
//#define INF 1000000000
#define INF 1000000000000000000

int main(){
  ll N;
  cin>>N;
  vector<ll> pows((int)N-1);
  for(ll i=0;i<N-1;i++){
    pows[i]=(i+1)*(i+1);
  }

  int ans=0;
  for(ll x=1;x<N;x++){
    int k=lower_bound(pows.begin(),pows.end(),N*N-x*x)-pows.begin();
    if(k==(int)N-1){
      continue;
    }
    if(x*x+pows[k]==N*N){
      ans++;
    }
  }
  cout<<ans<<endl;
}