#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    long long a, b, c, d;
    cin >> a >> b >> c >> d;
    auto sql = [](long long v) -> long long
    {
        long long l = 0, r = 1e9 + 7;
        while (r - l > 1)
        {
            long long mid = (l + r) / 2;
            (mid * mid <= v ? l : r) = mid;
        }
        return l;
    };
    auto dis = [](long long x, long long y) -> long long {return x * x + y * y;};
    auto check = [&](vector<long long> ans) -> bool
    {
        if (ans.size() != 7) return false;
        if (dis(ans[0], 0) == a && dis(ans[1], ans[2]) == b && dis(ans[3], ans[4]) == c && dis(ans[5], ans[6]) == d) return true;
        else return false;
    };
    long long y = sql(a);
    long long sumdxy = (b - d) / 2 / y;
    vector<long long> ans(7);
    long long v = sql((long long)abs(c - sumdxy * sumdxy));
    {
        long long ddxy = y - v;
        if ((ddxy + sumdxy) % 2 == 0)
        {
            long long dx = (ddxy + sumdxy) / 2, dy = sumdxy - dx;
            ans[0] = y;
            ans[1] = dx;
            ans[2] = y + dy;
            ans[3] = sumdxy;
            ans[4] = y + dy - dx;
            ans[5] = dy;
            ans[6] = y - dx;
            if (check(ans))
            {
                for (int i = 0; i < 7; ++i) cout << ans[i] << " \n"[i == 6];
                return 0;
            }
        }
    }
    {
        long long ddxy = y + v;
        if ((ddxy + sumdxy) % 2 == 0)
        {
            long long dx = (ddxy + sumdxy) / 2, dy = sumdxy - dx;
            ans[0] = y;
            ans[1] = dx;
            ans[2] = y + dy;
            ans[3] = sumdxy;
            ans[4] = y + dy - dx;
            ans[5] = dy;
            ans[6] = y - dx;
            if (check(ans))
            {
                for (int i = 0; i < 7; ++i) cout << ans[i] << " \n"[i == 6];
                return 0;
            }
        }
    }
}