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

#define int __int128

int sqrt(int x) {
    return sqrt((long double)x);
}

int perfect_sqrt(int x) {
    int res = sqrt(x);
    while (res * res > x) --res;
    while ((res + 1) * (res + 1) <= x) ++res;
    if (res * res == x) return res;
    return -1;
}

const int INF = 2e18;

int norm(array<int, 2> elem) {
    if (elem[0] > sqrt(INF) || elem[1] > sqrt(INF)) return -1;
    return elem[0] * elem[0] + elem[1] * elem[1];
}

void print(int x) {
    cout << (int64_t)x << " ";
}

void solve_() {
    int64_t a, b, c, d;
    cin >> a >> b >> c >> d;
    for (int _ = 0; _ < 2; ++_, swap(b, d)) {
        if (d - a != c - b) continue;
        int y = perfect_sqrt(a);
        if (y == -1) continue;
        int t = 2 * b - a - c;
        if (t % (2 * y) != 0) continue;
        t /= (2 * y);
        if (t > sqrt(INF) + 100) continue;
        int A = 2, B = 2 * (t + y), C = t * t + b - c;
        int D = B * B - 4 * A * C;
        D = perfect_sqrt(D);
        if (D == -1) continue;
        for (int s = -1; s <= 1; s += 2) {
            int dx = -B + s * D;
            if (dx % 4 != 0) continue;
            dx /= 4;
            int dy = dx + t;
            array<int, 2> pa = {0, y};
            array<int, 2> pb = {dx, y + dy};
            array<int, 2> pc = {dx - dy, y + dx + dy};
            array<int, 2> pd = {-dy, y + dx};
            if (norm(pa) != a) continue;
            if (norm(pb) != b) continue;
            if (norm(pc) != c) continue;
            if (norm(pd) != d) continue;
            if (_) swap(pb, pd);
            print(y);
            print(pb[0]); print(pb[1]);
            print(pc[0]); print(pc[1]);
            print(pd[0]); print(pd[1]);
            cout << "\n";
            return;
        }
    }
}

/// #define MULTITEST

main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int tst = 1;
#ifdef MULTITEST
    cin >> tst;
#endif // MULTITEST
    while (tst--) {
        solve_();
    }
    return 0;
}