#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;

int main(){
  int x[3], y[3];
  int X[4], Y[4];
  FOR (i, 0, 3) {
    cin >> x[i] >> y[i];
  }
  int v[3] = {0,1,2};
  do {
    FOR (i, 0, 3) {
      X[i] = x[v[i]];
      Y[i] = y[v[i]];
    }
    int dy = Y[1] - Y[0];
    int dx = X[1] - X[0];
    int nx = X[1] - dy;
    int ny = Y[1] + dx;
    if(nx != X[2] || ny != Y[2]) continue;
    nx = X[2] - dx;
    ny = Y[2] - dy;
    X[3] = nx;
    Y[3] = ny;
    nx = X[3] + dy;
    ny = Y[3] - dx;
    if(nx != X[0] || ny != Y[0]) continue;
    cout << X[3] << " " << Y[3] << endl;
    return 0;
  } while (next_permutation(v, v + 3));
  cout << -1 << endl;
  return 0;
}