#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }
template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }

typedef long long ll;
int const inf = 1<<29;

auto I = complex<double>(0, 1);

int main() {

  pair<int, int> ps[3]; rep(i,3) cin >>ps[i].first>>ps[i].second;
  sort(ps, ps+3);
  do {
    complex<double> v[2];
    rep(i, 2) {
      v[i] = complex<int>(ps[i+1].first - ps[0].first, ps[i+1].second - ps[0].second);
    }
    if(v[0] * I == v[1]) {
      cout << ps[0].first + (v[0] + v[1]).real() << " " << ps[0].second + (v[0] + v[1]).imag() << endl;
      exit(0);
    }
  } while(next_permutation(ps, ps+3));

  cout << -1 << endl;

  return 0;
}