#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <cmath>

using namespace std;

int gcd(int a, int b) {
	return b == 0 ? a : gcd(b, a % b);
}

int main() {
	int l;

	cin >> l;
	l /= 4;

	int a, b, c;
	int ans = 0;
	int limit = ceil(sqrt(l));

	for (int i = 1; i <= limit; i++) {
		for (int j = i + 1; j <= limit; j += 2) {
			if (gcd(i, j) > 1) {
				continue;
			}

			a = j * j - i * i;
			b = 2 * j * i;
			c = j * j + i * i;

			if (a + b + c > l) {
				break;
			}
			ans++;
		}
	}

	cout << ans << endl;
	return 0;
}