#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>

using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);

#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

void add_mod(ll& a, ll b){
	a = (a<MOD)?a:(a-MOD);
	b = (b<MOD)?b:(b-MOD);
	a += b;
	a = (a<MOD)?a:(a-MOD);
}


int main(void){
	ll x,y,n,ans=0ll;
	std::cin >> n; y = n;
	for(x=1ll; x<n; ++x){
		while(y>0 && x*x+y*y>n*n){
			--y;
		}
		if(x*x+y*y==n*n){
			++ans;
		}
	}
	std::cout << ans << std::endl;
	return 0;
}