#include <bits/stdc++.h>
using namespace std;

//repetition
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)

//container util
#define all(x) (x).begin(),(x).end()

//typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;

//const value
//const ll MOD = 1e9 + 7;
//const int dx[] = {0,1,0,-1};//{0,0,1,1,1,-1,-1,-1};
//const int dy[] = {1,0,-1,0};//{1,-1,0,1,-1,0,1,-1};

//conversion
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
inline ll toLL(string s) {ll v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

long long gcd( long long m, long long n ){

  if ( n == 0) return m;
  return gcd(n,m%n);
}//最大公約数

int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  ll L;
  cin >> L;
  ll ans = 0;

  for(ll n = 1; n*(n+1) <= L; n++){
    for(ll m = n+1; 8*m*(m+n) <= L; m++){
      if(gcd((m*m - n*n) , gcd(2*n*m, m*m + n*n)) == 1){
        ans++;
      }
    }
  }
  // int i = 0;
  // while(8*(i+1)*(2*i+1) - L <= 0){
  //   i++;
  // }
  // cout << i << endl;
  cout << ans << endl;
  return 0;
}