#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define pl pair<ll, ll>
#define pi pair<int, int>
#define minpq priority_queue<ll, vector<ll>, greater<ll>>
using namespace std;

#if 1
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '['; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "]";}
void _print() {cerr << endl << flush;}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "*["<<__LINE__<<"]\t"<< #x << " = "; _print(x)
#endif

const ll mod = 1e9 + 7;

template<typename T> bool chkmin(T &a, T b){return (b < a) ? a = b, 1 : 0;}
template<typename T> bool chkmax(T &a, T b){return (b > a) ? a = b, 1 : 0;}
ll gcd(ll a, ll b) {if(b == 0){return a;} return gcd(b, a % b);}

ll dp[10010][101][5][2];
 
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n; cin >> n; int m = ceil(sqrt(2 * n));
	for (int i = 0; i <= m; i ++) if (i * i <= n) dp[i * i][i][1][0] = 1;
	for (int k = 2; k <= 4; k ++){
		for (int i = 0; i <= 2 * n; i ++){
			for (int prv = 0; prv <= m; prv ++){
				for (int cur = 0; cur <= prv; cur ++){
					if (i >= cur * cur) dp[i][cur][k][0] += dp[i - cur * cur][prv][k - 1][0];
					if (i >= cur * cur && prv != cur) dp[i][cur][k][0] += dp[i - cur * cur][prv][k - 1][1];
					if (cur != 0){
						if (i + cur * cur <= 2 * n) dp[i][cur][k][1] += dp[i + cur * cur][prv][k - 1][1];
						if (i + cur * cur <= 2 * n && prv != cur) dp[i][cur][k][1] += dp[i + cur * cur][prv][k - 1][0];
					}
				}
			}
		}
	}
	ll ans = 0; for (int i = 0; i <= m; i ++) for (int j = 0; j < 2; j ++) ans += dp[n][i][4][j];
	cout << ans << '\n';
}