#include <cmath>
#include <iostream>

using namespace std;

struct coord {
  long long int x;
  long long int y;
};

#define _d(x, y) (pow((x), 2) + pow((y), 2))

struct coord a;
long long int da, db, dc, dd;
long long int bs, bl;

void find(long long int d, long long int low, long long int high) {
  // Binary search high
  long long int h = high, l = low;
  long long int mh = high;

  long long int sumD = _d(mh, l);
  long long int sumN = _d(mh+1, l);

  while (!(sumD <= d && sumN > d)) {
    if (sumD <= d) {
      l = mh;
    } else {
      h = mh;
    }
    mh = (l + h + 1)/2;
    sumD = _d(mh, low);
    sumN = _d(mh+1, low);
  }

  if (_d(low, mh) == d) {
    bs = low;
    bl = mh;
    return;
  }
  // printf("mh is: %d\n", mh);

  // Binary search low
  h = mh, l = low;
  long long int ml = low;
  sumD = _d(ml, mh);
  sumN = _d(ml-1, mh);

  while (!(sumD >= d && sumN < d)) {
    if (sumD < d) {
      l = ml;
    } else {
      h = ml;
    }
    ml = (l+h+1)/2;
    sumD = _d(mh, ml);
    sumN = _d(mh, ml-1);
  }

  // printf("%d %d\n", ml, mh);
  if (_d(ml, mh) == d) {
    bs = ml;
    bl = mh;
    return;
  }
  
  
  find(d, ml, mh);
}

bool test(long long int x, long long int y) {
  struct coord b, c, d;
  b.x = a.x + x;
  b.y = a.y + y;

  c.x = b.x - y;
  c.y = b.y + x;

  d.x = c.x - x;
  d.y = c.y - y;

  // printf("%d %d, %d %d, %d %d\n", b.x, b.y, c.x, c.y, d.x, d.y);
  long long int _db, _dc, _dd;
  _db = pow(b.x,2) + pow(b.y, 2);
  _dc = pow(c.x,2) + pow(c.y, 2);
  _dd = pow(d.x,2) + pow(d.y, 2);

  // printf("%d %d %d\n", _db, _dc, _dd);

  if (
    _db == db &&
    _dc == dc &&
    _dd == dd
  ) {
    printf("%lld %lld %lld %lld %lld %lld %lld", a.y, b.x, b.y, c.x, c.y, d.x, d.y);
    return true;
  }
  return false;
}


int main() {
  cin >> da >> db >> dc >> dd;

  a = {0ll, (int)sqrt(da)};

  // while (true) {
  //   // long long int x, y;
  //   // cin >> x >> y;
  //   // test(a, x, y);
  //
  //   // long long int x;
  //   // cin >> x;
  //   // find(x, 0, (int)sqrt(x) + 1);
  //   // printf("Ans: %d %d\n", sa, sb);
  // }

  find(db, 0, (long long int)sqrt(db)+1);

  while (true) {
    long long int rotX = bs - a.x;
    long long int rotY = bl - a.y;

    // cout << rotX << rotY;

#define check if (found) return 0;
    bool found = false;
    found = test(rotX, rotY); check
    found = test(rotX, -rotY); check
    found = test(-rotX, -rotY); check
    found = test(-rotX, rotY); check

    found = test(rotY, rotX); check
    found = test(rotY, -rotX); check
    found = test(-rotY, -rotX); check
    found = test(-rotY, rotX); check
    ;
    if (!found) {
      bl--;
      
      bs = sqrt(db - pow(bl, 2)) + 1;

      if (bs > bl) {
        return 0;
      }

      find(db, bs, bl-1);
    }
  }
}