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
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
// #pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,bmi,bmi2,lzcnt,abm,mmx,avx,avx2,tune=native")

#include <bits/stdc++.h>

using namespace std;

// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

// template <typename T>
// using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

#define rep(i, j) for (int i = 0; i < ((int)(j)); i++)
#define pb push_back
#define pf push_front
#define st first
#define nd second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define get_unique(x) x.erase(unique(all(x)), x.end());

const ll N = 5005;
ll ile1[N * N];
ll ile2[N * N];

ll calc(ll n) {
  rep(i, n * n + 10) {
    ile1[i] = 0;
    ile2[i] = 0;
  }

  for (ll a = 1; a <= n; a++) {
    for (ll b = a; b <= n; b++) {
      ile1[a * a + b * b]++;
    }
  }
  for (ll i = 1; i <= n; i++) {
    for (ll h = 1; h < i; h++) {
      ile2[i * i - h * h]++;
    }
  }

  ll ans = 0;
  for (int i = 1; i < N * N; i++)
    ans += ile1[i] * ile2[i];
  return ans;
}

ll brut(ll n) {
  ll ans = 0;
  for (ll a = 1; a <= n; a++) {
    for (ll b = a; b <= n; b++) {
      for (ll h = 1; h <= n; h++) {
        ll temp = a * a + b * b + h * h;
        ll pom = sqrt(temp);
        if (pom > n)
          break;
        if (pom * pom == temp)
          ans++;
      }
    }
  }

  return ans;
}

void TEST([[maybe_unused]] int testcase_i) {
  // for (int i = 1; i <= 1000; i++) {
  //   cout << i << endl;
  //   if (calc(i) != brut(i)) {
  //     cout << i << ": " << calc(i) << " " << brut(i) << endl;
  //   }
  // }
  ll n;
  cin >> n;
  cout << calc(n);
}

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

  // cout << setprecision(20) << fixed;

  // srand(time(NULL));

  // freopen("sorting.in", "r", stdin);
  // freopen("sorting.out", "w", stdout);

  int t = 1;
  // cin >> t;
  rep(i, t) {
    TEST(i);
  }

  return 0;
}