//A tree without skin will surely die.
//A man without face is invincible.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(S) ((int)S.size())
#define FOR(i, st_, n) for(int i = st_; i < n; ++i)
#define RFOR(i, n, end_) for(int i = (n)-1; i >= end_; --i)
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef unsigned long long ull;
typedef long double LD;
typedef pair<ull, ull> pull;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
using namespace std;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif

const ll MAX_SQ = 72;


// 36 36 -4 -4
vector<ll> nums;

bool ok()
{
	FOR(i,1,4)
	{
		if(abs(nums[i]) == abs(nums[i-1]) && nums[i] != nums[i-1])
			return false;
	}
	return nums[0] >= 0;
}

ll f(ll num, ll prev, int k)
{
	if(k==0)
	{
		if(num==0 && ok())
		{
			//for(auto item: nums)
				//cout<<item<<" ";
			//cout<<'\n';
			return 1;
		}
		return 0;
	}
	ll res=0;
	// add;
	for(ll i = 0; i*i <= abs(prev); ++i)
	{
		nums.pb({i*i});
		res += f(num-i*i, i*i,k-1);
		nums.pop_back();
	}
	for(ll i = 1; i*i <= abs(prev); ++i)
	{
		nums.pb({-i*i});
		res += f(num+i*i, i*i,k-1);
		nums.pop_back();

	}

	return res;
}

int solve()
{
	ll n;
	if(!(cin>>n))return 1;
	cout<<f(n,n,4)<<'\n';
    return 0;
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1e9;
    //cin >> TET;
    for (int i = 1; i <= TET; i++)
    {
        if (solve())
        {
            break;
        }
#ifdef ONPC
        cout << "__________________________" << endl;
#endif
    }
#ifdef ONPC
    cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
#endif
}