#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<fstream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>

#include <tuple> // new !

using namespace std;
typedef long long ll;

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

ll gcd(ll a,ll b){
    if(b == 0) return a;
    return gcd(b,a%b);
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll L;
    cin >> L;

    ll L2 = L/4;
    
    set<tuple<ll, ll, ll> > se;

    ll count = 0;
    FOR(m, 2, sqrt(L2)+1){
        FOR(n, 1, m){
            if(gcd(m, n)==1 && (m-n)%2==1){
                ll a = m*m - n*n;
                ll b = 2*m*n;
                ll c = m*m + n*n;

                if(a+b+c>L2) continue;

                ll mi = min(a, b);
                ll ma = max(a, b);
                se.insert(make_tuple(mi, ma, c));
            }
        }
    }

    p(se.size());
    
    return 0;
}