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
// Author: Olaf Surgut (surgutti)
// Created on 12-03-2025 12:19:58
#include "bits/stdc++.h"
using namespace std;

#define int long long
#define ll long long
#define ld long double

#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define all(x) begin(x),end(x)
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)

auto& operator<<(auto &o, pair<auto, auto> p) {
	return o << "(" << p.st << ", " << p.nd << ")";}
auto operator<<(auto &o, auto x)->decltype(end(x), o) {
	o << "{"; int i=0; for (auto e : x) o << ","+!i++ << e;
	return o << "}";}

#ifdef LOCAL
#define debug(x...) cerr << "[" #x "]: ", [](auto...$) { \
	((cerr << $ << "; "),...) << endl; }(x)
#else
#define debug(...)
#endif

#define rep(i,a,b) for(int i = a; i < (b); i++)
using pii = pair<int, int>;
using vi = vector<int>;

const int N = 5000 + 7;

int32_t cnt[2 * N * N];

signed main() {
	cin.tie(0)->sync_with_stdio(0);

	int n;
	cin >> n;

	FOR(a, 1, n)
		FOR(b, a, n)
			cnt[a * a + b * b]++;
	
	int ans = 0;
	FOR(x, 1, n) {
		for (int h = 1; h < x; h++) {
			debug(x, h, cnt[x * x - h * h]);
			ans += cnt[x * x - h * h];
		}
	}

	cout << ans << '\n';
	
	return 0;
}