#pragma GCC optimize("Ofast")

#include "bits/stdc++.h"

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep1n(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define each(x, a) for (auto &x : a)
#define ar array
#define vec vector
#define range(i, n) rep(i, n)

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;

int Bit(int mask, int b) { return (mask >> b) & 1; }

template<class T>
bool ckmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool ckmax(T &a, const T &b) {
    if (b > a) {
        a = b;
        return true;
    }
    return false;
}

// [l, r)
template<typename T, typename F>
T FindFirstTrue(T l, T r, const F &predicat) {
    --l;
    while (r - l > 1) {
        T mid = l + (r - l) / 2;
        if (predicat(mid)) {
            r = mid;
        } else {
            l = mid;
        }
    }
    return r;
}


template<typename T, typename F>
T FindLastFalse(T l, T r, const F &predicat) {
    return FindFirstTrue(l, r, predicat) - 1;
}

const ll INF = 2e18;
const int INFi = 1e9;
const int N = 2e5 + 5;
const int LG = 20;

ll my_sqrt(ll x) {
    ll t = sqrtl(x);
    while (t * t < x) t++;
    while (t * t > x) t--;
    return t;
}

pair<ll, ll> rot(pair<ll, ll> p) {
    swap(p.first, p.second);
    p.second *= -1;
    return p;
}

void solve() {

    // (s - x)^2 + y^2 = B
    // (s - y)^2 + x^2 = D
    // s^2 + x^2 + y^2 - 2sx = B
    // s^2 + x^2 + y^2 - 2sy = D

    // s^2 + x^2 + y^2 - 2sx = B
    // x - y = (D - B) / (2s)

    ll AO, BO, CO, DO; cin >> AO >> BO >> CO >> DO;

    ll s = my_sqrt(AO);
    ll B = BO;
    ll D = DO;
    ll diff = (D - B) / (2 * s); // (x - y)
    assert(diff * (2 * s) == D - B);

    // x = y + diff
    // s^2 + (y+diff)^2 + y^2 - 2s(y+diff) = B
    // 2y^2 + 2y(diff - s) + (s^2 + diff^2 - 2s * diff) - B = 0

    ll a = 2;
    ll b = 2 * (diff - s);
    ll c = (s - diff) * (s - diff) - B;

    b /= 2;
    ll y = (-b + my_sqrt(b * b - a * c)) / a;
    ll x = y + diff;


    pair<ll, ll> Ap = {0, s};
    pair<ll, ll> Bp = {-y, s - x};
    auto sqr2 = [&] (pair<ll, ll> p) { return p.first * p.first + p.second * p.second; };
    rep(t, 2) {
        pair<ll, ll> Dp = {x, s - y};
        if (t) Dp.first *= -1;
        assert(sqr2(Ap) == AO);
        assert(sqr2(Bp) == BO);
        assert(sqr2(Dp) == DO);
        pair<ll, ll> Cp = {Dp.first + Bp.first - Ap.first, Dp.second + Bp.second - Ap.second};
        if (sqr2(Cp) != CO) continue;
        pair<ll, ll> AB = {Bp.first - Ap.first, Bp.second - Ap.second};
        pair<ll, ll> AD = {Dp.first - Ap.first, Dp.second - Ap.second};
        if (rot(AB) != AD && rot(AD) != AB) continue;
        cout << Ap.second << ' ' << Bp.first << ' ' << Bp.second << ' ' << Cp.first << ' ' << Cp.second << ' ' << Dp.first << ' ' << Dp.second << '\n';
        return;
    }
    assert(0);

}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(12) << fixed;
    int t = 1;
//    cin >> t;
    rep(i, t) {
        solve();
    }
    return 0;
}