#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <queue>
#include <map>
#include <cmath>
#include <iomanip>

using namespace std;

const long long MOD = (long long)(1e9) + 7;

int main() {

  //cout << fixed << setprecision(15);

  long long n;
  cin >> n;
  int ans = 0;
  for (long long x = 1; x <= n; x++) {
    long long ok = n + 1;
    long long ng = 0;
    while (ok - ng > 1) {
      long long mid = (ok + ng) / 2;
      if (x * x + mid * mid >= n * n) {
        ok = mid;
      } else {
        ng = mid;
      }
    }
    if (x * x + ok * ok == n * n) ans++;
  }
  cout << ans << endl;
  return 0;
}