#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using ll = long long;
#define all(p) p.begin(), p.end()
const ll INF = (1ll << 61);

ll mul(ll a, ll b){
    if (a == 0 || b == 0) return 0;
    if (a < 0) a *= -1, b *= -1;
    if (INF / a > b) return a * b;
    return INF;
}

ll sqrt(ll a){
    if (a < 0) return -1;
    ll l = 0, r = INF - 1;
    while (r - l > 1){
        ll m = (l + r) / 2;
        if (mul(m, m) > a) r = m;
        else l = m;
    }
    if (l * l == a) return l;
    else return -1;
}

void solve(){
    ll OA, OB, OC, OD;
    cin >> OA >> OB >> OC >> OD;
    vector<ll> dist = {OB, OC, OD};
    ll a = sqrt(OA);
    vector<int> order = {0, 1, 2};
    do{
        vector<ll> p(3);
        rep(i, 0, 3) p[i] = dist[order[i]];
        ll sum, diff;
        if (abs(p[0] - p[2]) % (2 * a)) continue;
        sum = (p[0] - p[2]) / (2 * a);
        if (sum > (1ll << 31)) continue;
        ll tmp = sqrt(p[1] - sum * sum);
        if (tmp == -1) continue;
        rep(rp, 0, 2){
            diff = (rp ? 1 : -1) * tmp;
            diff -= a;
            // cout << a << " " << sum << " " << diff << endl;
            ll b = diff + sum, c = diff - sum;
            if (b & 1) continue;
            b /= 2, c /= 2;
            // cout << b << " " << c << endl;
            vector<ll> ans(8);
            bool ok = 1;
            ans[0] = 0, ans[1] = a;
            ll X = 0, Y = a;
            rep(k, 0, 3){
                X += c;
                Y += b;
                swap(c, b);
                c *= -1;
                // cout << X << " " << Y << endl;
                if (mul(X, X) + mul(Y, Y) != p[k]) ok = 0;
                ans[order[k] * 2 + 2] = X;
                ans[order[k] * 2 + 3] = Y;
            }
            if (ok){
                rep(i, 1, 8){
                    cout << ans[i] << (i == 7 ? "\n" : " "); 
                }
                return;
            }
        }
    }while(next_permutation(all(order)));
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--) solve();
}
/*
36 5 10 41
*/