#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <functional>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cctype>
#include <string>
#include <cstring>

using namespace std;

typedef long long ll;

int main() {
  int x1, y1, x2, y2, x3, y3;
  cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3;
  int xs[] = {x1, x2, x3}, ys[] = {y1, y2, y3};

  int ax, ay;
  int dx, dy;
  for (int i = 0; i < 3; i++) {
    for (int j = i+1; j < 3; j++) {
      if (xs[j]-xs[i] != 0 || ys[j]-ys[i] != 0) {
        dx = xs[j]-xs[i];
        dy = ys[j]-ys[i];
        ax = xs[i];
        ay = ys[i];

        for (int p = 0; p < 2; p++) {
          int cnt = 0;
          int tx, ty;
        
          for (int k = 0; k < 4; k++) {
            ax += dx; ay += dy;
            bool yes = false;
            for (int l = 0; l < 3; l++) {
              if (ax == xs[l] && ay == ys[l]) yes = true;
            }
            if (!yes) {
              tx = ax; ty = ay;
              cnt++;
            }
            if (p == 0) dx = -dx;
            if (p == 1) dy = -dy;
            swap(dx, dy);
          }
          if (cnt == 1) {
            cout << tx << " " << ty << endl;
            return 0;
          }

        }
      }
    }
  }

  cout << -1 << endl;
}