1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include <unistd.h>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <utility>
#include <deque>
#include <iostream>
#include <algorithm>
#include <limits>
#include <cmath>

// using namespace std;
#define REP(i,n) for(int _n=(n), i=0;i<_n;++i)
#define FOR(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FORD(i,a,b) for(int i=(a),_b=(b);i>=_b;--i)
#define TRACE(x) cerr << "TRACE(" #x ")" << endl;
#define DEBUG(x) cerr << #x << " = " << (x) << endl;
typedef long long LL;
typedef unsigned long long ULL;
using VINT = std::vector<int>;
using VLL = std::vector<LL>;
using VULL = std::vector<ULL>;

struct Range {
  long from = 0;
  long to = 0;
};

int main() {
  std::ios_base::sync_with_stdio(false);
  int i, n, b, c;

  int ret = 0;

  std::cin >> i;

  for (int n = i; n > 2; n--) {
    for (int a = n-1; a>1; a--) {
      b = sqrt(n*n - a*a);
      b = std::min(b, a);
      for (; b>0; b--) {
        int c = sqrt(n*n - a*a - b*b);
        if (c == 0) continue;
        if (c > b) break;

        if (a*a + b*b + c*c != n*n) continue;

        if (a == b || a == c || b == c) ret += 2;
        else ret += 3;
      }
    }
  }

  std::cout << ret << std::endl;
  
  return 0;
}