#include<iostream>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
using ll = long long;

int main(void){
  ll n; cin >> n;
  set<ll> sq;
  for(ll i=1; i<=n; i++) sq.insert(i*i);
  int ans=0;
  for(ll i=1; i<n; i++){
    ll rem=n*n-i*i;
    ans+=sq.count(rem);
  }
  cout << ans << endl;
  return 0; 
}