// yuki 1593 Perfect Distance
// 2021.8.11

#include <stdio.h>
#include <math.h>

typedef long long ll;

int main() {
	int N, i, j, ans = 0;
	ll N2;

	scanf("%d", &N), N2 = (ll)N*N;
	int k = N/sqrt(2)+1;
	for (i = 1; i <= k; ++i) {
		ll t = N2-i*i;
		if (t < 0) continue;
		j = sqrt(t);
		if (j*j == t && i < j) ++ans;
	}
	printf("%d\n", 2*ans);
	return 0;
}