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
59
60
61
62
63
#include <bits/stdc++.h>

using namespace std;

#define _DEBUG
#ifdef _DEBUG
template<typename T1, typename T2> auto& operator<<(ostream& o, pair<T1, T2> a) { return o << "(" << a.first << ", " << a.second << ")"; }
template<typename T, typename OS> auto& operator<<(OS& o, T a) { o << "{"; for(auto b : a) o << b << ", "; return o << "}"; }
#define dbg(x...) cerr << "[" #x "]: ", [](auto... args) { ((cerr << args << ", "),...) << "\n"; }(x)
#else
#define dbg(...)
#endif

#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define F first
#define S second

using ll = long long;
using ld = long double;
using pll = pair<ll,ll>;
using vi = vector<int>;

void solve() {
  ll n;
  cin >> n;
  
  vector<ll> possible(n * n + 1);

  for(ll a = 1; a < n; a++) {
    for(ll b = a; b < n; b++) {
      if(a * a + b * b <= n * n) {
        possible[a * a + b * b]++;        
      }
    }
  }

  ll ans = 0;

  for(ll diag = 1; diag <= n; diag++) {
    for(ll h = 1; h < diag; h++) {
      ans += possible[diag * diag - h * h];      
    }
  }

  cout << ans;
}

int main() {
  // for(int i = 0; i < 1000000; i++) {
    // test();
  // }
  // return 0;
  //test();
  cin.tie(0)->sync_with_stdio(0);
  int t = 1;
  //cin >> t;
  while(t--) {
    solve();
    cout << "\n";
  }
  return 0;
}