/* -*- coding: utf-8 -*-
 *
 * 1593.cc:  No.1593 Perfect Distance - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 200000;

/* typedef */

typedef long long ll;

/* global variables */

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);
  ll nn = (ll)n * n;

  // sqrt(x^2+y^2)=n -> x^2+y^2=n^2 -> y^2=n^2-x^2

  int cnt = 0;
  for (int x = 1; x < n; x++) {
    ll yy = nn - (ll)x * x;
    int y = sqrt(yy + 0.5);
    if ((ll)y * y == yy) cnt++;
  }

  printf("%d\n", cnt);
  return 0;
}