#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define yn           \
    { puts("YES"); } \
    else {           \
        puts("NO");  \
    }
#define MAX_N 200005
ll a[MAX_N];
int main() {
    ll n;
    cin >> n;
    n = n * n;

    rep(i, MAX_N) { a[i] = (ll)(i + 1) * (i + 1); }

    int ans = 0;

    srep(i, 1, MAX_N) {
        ll x = (ll)i * i;
        if (*lower_bound(a, a + MAX_N, n - x) == n - x) ans++;
    }

    cout << ans << endl;
    return 0;
}