#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)

// return such maximum x that x^2 <= n 
ll isqrt(ll n) {
    double r = sqrt(n);
    rep(i, max(0LL, (ll)r-10), (ll)r+10) if(i*i > n) return i-1;
}

void solve() {
    ll n;
    cin >> n;
    ll ans = 0;
    for(ll x = 1; x * x < n * n; x++) {
        ll yy = n * n - x * x;
        if(isqrt(yy) * isqrt(yy) == yy) ans++;
    }    
    cout << ans << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}