#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);}

bool issq(ll x){
	ll y = floor(sqrt(x));
	if (y * y == x || (y + 1) * (y + 1) == x) return true;
	return false;
}

ll getsq(ll x){
	ll y = floor(sqrt(x));
	if (y * y == x) return y;
	return y + 1;
}

int ans[4];
 
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	ll n; cin >> n;
	for (ll i = 1; i < n; i ++){
		if (issq(n * n - i * i)){
			ll j = getsq(n * n - i * i);
			if (j > i) continue;
			if (gcd(gcd(i, j), n) == 1){
				ans[0] ++;
			} else{
				ans[1] ++;
			}
		}
	}
	for (ll i = 1; i < n * n; i ++){
		if (issq(n * n + i * i)){
			ll j = getsq(n * n + i * i);
			if (gcd(gcd(i, j), n) == 1){
				ans[2] ++;
			} else{
				ans[3] ++;
			}
		}
	}
	for (int i = 0; i < 4; i ++) cout << ans[i] << ' ';
}