#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std; // NOLINT

int main() {
    int64_t n;
    cin >> n;
    unordered_set<int64_t> sqrts;
    for (int64_t i = 1; i * i < n * n; ++i) {
        sqrts.insert(i * i);
    }
    int32_t ans = 0;
    for (int64_t x = 1; x * x < n * n; ++x) {
        auto y2 = n * n - x * x;
        if (sqrts.find(y2) != sqrts.end())
            ++ans;
    }
    cout << ans << endl;
    return 0;
}