#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll MOD = 1e9 + 7;
//constexpr ll MOD = 998244353;
//constexpr ll MOD = ;
ll mod(ll A, ll M) {return (A % M + M) % M;}
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll divceil(ll A, ll B) {return (A + (B - 1)) / B;}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)

bool issquare(ll y)
{
  ll ok = 0, ng = y + 1;
  while (abs(ok - ng) > 1)
  {
    ll mid = (ok + ng) / 2;
    if (mid <= y / mid)
      ok = mid;
    else
      ng = mid;
  }
  return (ok * ok == y);
}

int main()
{
  //*
  ll N;
  cin >> N;
  //*/

  //for (ll N = 0; N < 5000; N++)
  {
    ll ans = 0;
    for (ll x = 1; x < N; x++)
    {
      if (issquare(N * N - x * x))
        ans++;
    }
    cout << ans << endl;

    /*
    ll ans2 = 0;
    for (ll x = 1; x < N; x++)
    {
      for (ll y = 1; y < N; y++)
      {
        if (x * x + y * y == N * N)
          ans2++;
      }
    }

    cerr << N << endl;
    if (ans != ans2)
    {
      cerr << ans << " " << ans2 << endl;
      return 0;
    }
    //*/
  }
}