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

int main() {
    ll n;
    cin >> n;
    vector<ll> vec(n);
    for (int i = 1; i < n; i++) {
        vec[i] = i * i;
    }
    int ans = 0;
    int l = 1; int r = n - 1;
    while (r > l) {
        ll tmp = vec[l] + vec[r];
        if (tmp == n * n) {
            ans += 2;
            l++;
            r--;
        }
        else if (tmp < n * n) {
            l++;
        }
        else r--;
    }
    if (l == r && vec[l] + vec[l] == n*n) ans++;
    cout << ans << endl;
}