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
64
65
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define int long long
#define pii pair<int, int>
#define fi first
#define se second

const int INF = 1e15 + 7;
const int MAXN = 5e3 + 7;
const int MX = 25e6;


int ile[MAXN * MAXN]; 




void solve(){
	
	int n;
	cin >> n;
	
	for(int a = 1; a <= n; a++){
		
		for(int b = a; b <= n; b++){
			
			ile[a * a + b * b]++;
		}
	}
	
	int ans = 0;
	
	for(int diag = 1; diag <= n; diag++){
		
		for(int h = 1; h <= n; h++){
			
			int x = diag * diag - h * h;
			if(x >= 0 && x <= n * n){
				
				ans += ile[x];
				//if(ile[x] > 0) cout << diag << ' ' << h << ' ' << ile[x] << '\n';
			}
		}
	}

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

bool multi = 0;

signed main(){
	
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	
	int t = 1;
	if(multi) cin >> t;
	while(t--) solve();
	
	return 0;
}