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

#define pb push_back

const ld pi = 3.14159265358979323846;
const ll INF = 1e18;

template<typename T>
T chmax(T a, T b) {
    return a > b ? a : b;
}

template<typename T>
T chmin(T a, T b) {
    return a > b ? b : a;
}

void solve() {
    int n;
    cin >> n;

    int mx = sqrt(n);
    int ans{};
    for (int a = 0; a <= mx; a++) {
        int a2 = a * a, aneg = (a < 0 ? -1 : 1);
        for (int b = -abs(a); b <= abs(a); b++) {
            int b2 = b * b, bneg = (b < 0 ? -1 : 1);
            if (abs(a) == abs(b) && a != b) continue;

            for (int c = -abs(b); c <= abs(b); c++) {
                int c2 = c * c, cneg = (c < 0 ? -1 : 1);
                if (abs(c) == abs(b) && b != c) continue;

                int d2 = n - (a2 * aneg + b2 * bneg + c2 * cneg);
                int dneg = (d2 < 0 ? -1 : 1);

                int d = sqrt(abs(d2));
                if (d * d != abs(d2)) continue;
                if (d > abs(c)) continue;
                if (abs(d2) == c2 && (d2 < 0 != c < 0)) continue;

                int test = a2 * aneg + b2 * bneg + c2 * cneg + d * d * dneg;
                if (test != n || b2 > a2 || c2 > b2 || d * d > c2 ||
                    (a2 == b2 && aneg != bneg) || (b2 == c2 && bneg != cneg) || (c2 == d * d && cneg != dneg)) {
                    cout << "bad" << '\n';
                }
                ans++;
            }
        }
    }

    cout << ans << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}