#include <bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define int long long
#define endl "\n"
#define pi acos(-1)
typedef pair<int, int> PII;
typedef pair<int, PII> PIII;
const int N = 1e6 + 10, M = 1010, INF = 0x3f3f3f3f, mod = 998244353;
set<PII> s;
vector<PII> d;
int n;
int a, b, c, e;
int check(int x)
{
    int a = sqrt(x);
    if (a * a == x)
        return 1;
    return 0;
}
int asd(int x, int y, int z)
{
    int u = __gcd(x, y);
    int v = __gcd(y, z);
    if (__gcd(u, v) == 1)
        return 1;
    return 0;
}
void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            if (i * i + j * j == n * n)
            {
                if (i > j)
                    s.insert({j, i});
                else
                    s.insert({i, j});
            }
        }
    }

    for (int i = 1; i <= N*10; i++)
    {
        if (check(i * i + n * n))
            d.push_back({i, sqrt(i * i + n * n)});
    }
    for (auto [x, y] : s)
    {
        if (asd(x, y, n))
            a++;
        else
            b++;
    }
    for (auto [x, y] : d)
    {
        if (asd(x, n, y))
            c++;
        else
            e++;
    }
    cout << a << ' ' << b << ' ' << c << ' ' << e << endl;
}
signed main()
{
    ios;
    int T = 1;
    // cin >> T;
    while (T--)
        solve();
    return 0;
}