#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int MAX = 15000;
ll dp[5][MAX + 1][71];

int n;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cin >> n;
	vector<int> valid;
	valid.push_back(0);
	for(int i = 1; i * i <= n; i++) {
		valid.push_back(i * i);
		valid.push_back(-i * i);
	}
	sort(valid.begin(), valid.end());
	int ans = 0;
	for(int i = 0; i < valid.size(); i++) {
		for(int j = i; j < valid.size(); j++) {
			for(int k = j; k < valid.size(); k++) {
				for(int l = k; l < valid.size(); l++) {
					if((valid[i] && (valid[i] == -valid[j] || valid[i] == -valid[k] || valid[i] == -valid[l])) || (valid[j] && (valid[j] == -valid[k] || valid[j] == -valid[l])) || (valid[k] && valid[k] == -valid[l])) {
						continue;
					}
					if(valid[i] < 0 && abs(valid[i]) > max({abs(valid[j]), abs(valid[k]), abs(valid[l])})) {
						continue;
					}
					if(valid[i] + valid[j] + valid[k] + valid[l] == n) {
						ans++;
					}
				}
			}
		}
	}
	cout << ans << "\n";
}