#include <bits/stdc++.h>
//#include <atcoder/modint>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
typedef long long ll;
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
ll keta_(ll a){ll r=0;while(a){a/=10;r++;}return r;}



int main(){

	ll N;
	cin >> N;

	ll ans = 0;
	FOR(i,1,N+1){
		ll jj = N*N - i*i;
		if(jj <= 0) continue;
		ll j = sqrt(jj);
		if(j*j == jj) ans++;
	}
	cout << ans << endl;
}