#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))
#define uniq(v) (v).erase(unique(all(v)), (v).end())

using namespace std;

typedef int i32;
typedef long long i64;
typedef long double f80;
typedef vector<i32> vi32;
typedef vector<i64> vi64;
typedef vector<f80> vf80;
typedef vector<string> vstr;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "-1" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, const vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }

void solve() {
  vi32 X(3), Y(3);
  rep(i, 3) cin >> X[i] >> Y[i];

  vi32 o(3);
  iota(all(o), 0);

  do {
    int d1 = power(X[o[0]] - X[o[1]], 2) + power(Y[o[0]] - Y[o[1]], 2);
    int d2 = power(X[o[1]] - X[o[2]], 2) + power(Y[o[1]] - Y[o[2]], 2);
    int d3 = power(X[o[2]] - X[o[0]], 2) + power(Y[o[2]] - Y[o[0]], 2);
    
    if (d1 == d2 && d1 + d2 == d3) {
      cout << X[o[0]] + (X[o[2]] - X[o[1]]) << " " <<
              Y[o[0]] + (Y[o[2]] - Y[o[1]]) << '\n';
      return;
    }
  } while (next_permutation(all(o)));

  cout << -1 << '\n';
}