#include <bits/stdc++.h>
#define pii pair<int,int>
#define pb push_back
#define yes "YES"
#define no "NO"
#define ll long long
#define MOD 1000000007
#define all(x) x.begin(),x.end()
#define MOD2 998244353
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename T> 
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void solve(int cas){
    ll n;
    cin>>n;
    ll squared = n*n, ans1 = 0, ans2 = 0;
    for (ll i = 1; i < n; i++){
        ll diff = squared - i*i;
        ll s = static_cast<ll> (sqrtl(diff));
        if (s*s==diff && s>=i){
            if (__gcd(s,i)==1 && __gcd(i,n)==1 && __gcd(s,n)==1){
                ans1++;
            }
            else{
                ans2++;
            }
        }
    }
    cout<<ans1<<" "<<ans2<<" ";
    ll ans3 = 0, ans4 = 0;
    for (ll i = n+1; i <= static_cast<ll> (4e7); i++){
        ll diff = i*i - squared;
        ll s = static_cast<ll> (sqrtl(diff));
        if (s*s==diff){
            if (__gcd(s,i)==1 && __gcd(i,n)==1 && __gcd(s,n)==1){
                ans3++;
            }
            else{
                ans4++;
            }
        }
    }
    cout<<ans3<<" "<<ans4<<endl;
    
}
int main(){
    int t=1;
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    //cin>>t;
    for (int i = 1; i<=t; i++){
        solve(i);
    }
    return 0;
}