#include <bits/stdc++.h>


using namespace std;
using ll = long long;


unordered_set<int> xd;

int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	ll n;
	cin >> n;
	ll ans = 0ll;
	for (int i = 1; i <= n; i++){
		xd.insert(i*i);
	}
	for (ll a = 1; a <= n; a++){
		for (ll b = a; b <= n; b++){
			for (ll h = 1; h <= n; h++){
				if (((a*a) + (b*b) + (h*h)) <= (n*n) && xd.count(((a*a) + (b*b) + (h*h)))){
					ans++;
			}
		}	
	}
	}
	cout << ans;
	return 0;
}