#include <iostream>
#include <algorithm>
#include <set>
using namespace std;
typedef long long ll;
int main()
{
    ll L;
    while (cin>>L) {
        ll l=L/4;
        set<tuple<ll, ll, ll>> s;
        for(ll n=1;n<l;++n) {
            for(ll m=n+1;;++m) {
                if ((m-n)%2==1 and __gcd(m, n)==1) {
                    ll a=min(m*m-n*n, 2*m*n);
                    ll b=max(m*m-n*n, 2*m*n);
                    ll c=m*m+n*n;
                    if (a+b+c>l) break;
                    s.emplace(a, b, c);
                }
            }
        }
        cout<<s.size()<<endl;
    }
}