#include <bits/stdc++.h>
// #include <atcoder/modint>
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define INF 2000000000000000000
#define ll long long
#define ld long double
#define pll pair<ll, ll>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll N;
  cin >> N;
  ll ans = 0;
  map<ll, bool> mp;
  for (ll i = 1; i <= N; ++i) {
    mp[i * i] = true;
  }
  for (ll i = 1; i < N; ++i) {
    ll M = N * N - i * i;
    if (mp.find(M) != mp.end()) {
      ans += 1;
    }
  }
  cout << ans << "\n";
}