#include <bits/stdc++.h>
using namespace std;
int main(){
  int N;
  cin >> N;
  set<long long> st;
  for (int i = 1; i < N; i++){
    st.insert((long long) i * i);
  }
  int ans = 0;
  for (int i = 1; i < N; i++){
    long long p = (long long) N * N - (long long) i * i;
    if (st.count(p) == 1){
      ans++;
    }
  }
  cout << ans << endl;
}