#include <iostream>
#include <vector>

using namespace std;

#define REP(i,n,k) for (int i = k; i <= n; i++)
#define SIMPLEVEC vector<int>
#define LL long long

class Aquarium {
    int n{}, max{};
    SIMPLEVEC cnt;

public:
    void solve() {
        cin >> n;

        max = n * n;
        cnt.resize(max + 1, 0);

        REP(a, n, 1) {
            int a2 = a * a;
            REP(b, n, a) {
                int s = a2 + b * b;
                if (s > max) break;
                cnt[s]++;
            }
        }

        LL ans = 0;
        REP(d, n, 1) {
            int d2 = d * d;
            for (int h = 1; h < d; h++) {
                int s = d2 - h * h;
                if (s <= max) {
                    ans += cnt[s];
                }
            }
        }

        cout << ans << endl;
    }
};

int main() {
    Aquarium aquarium;
    aquarium.solve();

    return 0;
}