#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;

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

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; }

using P = pair<int, int>;

void solve() {
  vector<P> xy(3);
  rep(i, 3) {
    int x, y; cin >> x >> y;
    xy[i] = P(x, y);
  }

  int idx = -1;
  rep(i, 3) {
    P a = xy[i], b = xy[(i+1)%3], c = xy[(i+2)%3];
    int diff1 = power(a.first - b.first, 2) + power(a.second - b.second, 2);
    int diff2 = power(b.first - c.first, 2) + power(b.second - c.second, 2);
    int diff3 = power(c.first - a.first, 2) + power(c.second - a.second, 2);
    if (diff1 == diff2 && diff1 + diff2 == diff3) idx = i;
  }
  if (idx == -1) no();

  if (idx == 2) {
    swap(xy[0], xy[2]);
    swap(xy[1], xy[2]);
  } else if (idx == 1) {
    swap(xy[1], xy[2]);
  }

  P a = xy[0], b = xy[1], c = xy[2];
  int x = a.first - b.first;
  int y = a.second - b.second;

  if (a.first + y == c.first && a.second - x == c.second) {
    cout << b.first + y << " " << b.second - x << '\n';
  } else if (a.first - y == c.first && a.second + x == c.second) {
    cout << b.first - y << " " << b.second + x << '\n';
  } else if (b.first + y == c.first && b.second - x == c.second) {
    cout << a.first + y << " " << a.second - x << '\n';
  } else if (b.first - y == c.first && b.second + x == c.second) {
    cout << a.first - y << " " << a.second + x << '\n';
  }
}