#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
vector<long long> vec;
int main() {
	long long n;
	cin >> n;
	for (long long i = 1; i <= n; i++) {
		vec.emplace_back(i * i);
	}
	n = n * n;
	long long co = 0;
	for (int i = 0; i < vec.size(); i++) {
		if (binary_search(vec.begin(), vec.end(), n - vec[i]))co++;
	}
	cout << co << endl;
}