#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    
    auto solve = [&]() {
        int c;
        cin >> c;

        auto primitive = [&](int a, int b, int c) {
            return gcd(a, b) == 1 && gcd(b, c) == 1 && gcd(c, a) == 1;
        };

        int ans1 = 0, ans2 = 0;
        for (int a = 1; a < c; a++) {
            for (int b = a; b < c; b++) {
                if (a * a + b * b == c * c) {
                    if (primitive(a, b, c)) {
                        ans1++;
                    } else {
                        ans2++;
                    }
                }
            }
        }

        cout << ans1 << ' ' << ans2 << ' ';

        ans1 = ans2 = 0;

        for (int x = 1; x < c; x++) {
            if (c * c % x == 0) {
                int y = c * c / x;
                if (x % 2 != y % 2) {
                    continue;
                }
                int a = (x + y) / 2, b = (y - x) / 2;
                if (primitive(c, b, a)) {
                    ans1++;
                } else {
                    ans2++;
                }
            }
        }

        cout << ans1 << ' ' << ans2 << '\n';
    };

    solve();

    return 0;
}