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
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <deque>
#include <tuple>
#include <bitset>

using namespace std;

#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define x first
#define y second

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;

int S[25000000];

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int n;
    cin >> n;

    int ans = 0;
    for(int c=1; c<=n; c++){
        for(int d=1; d<=n; d++){
            int C = c*c;
            int D = d*d;
            if(D>=C){
                S[D-C]++;
                // cout << d << " " << c << " " << D-C << "\n";
            }
        }
    }

    // cout << "--------------------------\n";

    for(int a=1; a<=n; a++){
        for(int b=a; b<=n; b++){
            int A = a*a;
            int B = b*b;
            if(A+B<25000000 && S[A+B]){
                ans+=S[A+B];
                // cout << a << " " << b << " " << A+B << " " << S[A+B] << "\n";
            }
        }
    }
    cout << ans << "\n";
    
    return 0;
}