#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> 
// #include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
// using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
 
typedef pair<ll, ll> pl;
typedef pair<ld,ld> pd;
typedef vector<ll> vl;
// typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
 
 
#define G(x) ll x; cin >> x;
#define F(i, l, r) for (ll i = l; i < (r); ++i)
#define all(a) begin(a), end(a)
#define K first
#define V second
#define OK(i,j) i >= 0 && i < n && j >= 0 && j < m
 
#define NN 2505
#define MM 5005
#define MOD 1000007

ll A[NN], B[NN], C[NN];
set<vector<ll>> seen;

void solve() {

    ll n;
    cin >> n;

    ll u = 1, v;
    ll a, b, c;
    while(u < 1251) {
        v = 1;
        while(v < u) {
            if(v > 1 && gcd(u,v) > 1) {
                v++;
                continue;
            }
            a = min(u*u-v*v,2*u*v);
            b = max(u*u-v*v,2*u*v);
            c = u*u+v*v;

            if(gcd(gcd(a,b),c) > 1) {
                v++;
                continue;
            }

            if(seen.count({a,b,c}) == 0) {
                seen.insert({a,b,c});
                if(a < NN) A[a]++;
                if(b < NN) B[b]++;
                if(c < NN) C[c]++;
            }
            v++;
        }
        u++;
    }

    ll ans[4];
    ans[0] = C[n];
    ans[1] = 0;
    for(ll i=2;i<n;i++) if(n%i == 0) ans[1] += C[i];

    ans[2] = A[n] + B[n];
    ans[3] = 0;
    for(ll i=2;i<n;i++) if(n%i == 0) ans[3] += A[i] + B[i];

    cout << ans[0] << ' ' << ans[1] << ' ' << ans[2] << ' ' << ans[3] << '\n';

}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cout << fixed << setprecision(10);

    solve();

    return 0;

}