// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}


int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int x[4], y[4];
  rep(i, 3)cin >> x[i] >> y[i];
  for(x[3] = - 200; x[3] <= 200; x[3]++){
    for(y[3] = - 200; y[3] <= 200; y[3]++){
      map<int, int> mp;
      for(int k = 0; k < 4; k++){
        for(int l = k + 1; l < 4; l++){
          mp[(x[k] - x[l]) * (x[k] - x[l]) + (y[k] - y[l]) * (y[k] - y[l])]++;
        }
      }
      int key1 = (mp.begin())->first;
      int key2 = (mp.rbegin())->first;
      if(key1 * 2 != key2){
        continue;
      }
      if(mp[key1] != 4 || mp[key2] != 2){
        continue;
      }
      cout << x[3] << " " << y[3] << endl;
      return 0;
    }
  }
  cout << -1 << endl;
	return 0;
}