#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (ll i = (s); i < (ll)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (ll i = (ll)(s - 1); i >= (ll)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
bool chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
bool chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") {
    cout << (f ? yes : no) << "\n";
}

void solve() {
    using P = pair<int, int>;
    vector<P> p(3);
    rep(i, 3) cin >> p[i].first >> p[i].second;
    sort(all(p));
    do {
        P a = {p[1].first - p[0].first, p[1].second - p[0].second};
        P b = {p[2].first - p[0].first, p[2].second - p[0].second};
        int a2 = a.first * a.first + a.second * a.second;
        int b2 = b.first * b.first + b.second * b.second;
        int dot = a.first * b.first + a.second * b.second;
        if (a2 == b2 && dot == 0) {
            int x = p[0].first + a.first + b.first;
            int y = p[0].second + a.second + b.second;
            cout << x << " " << y << '\n';
            return;
        }
    } while (next_permutation(all(p)));
    cout << -1 << '\n';
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    rep(ti, t) solve();
    return 0;
}