#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std; // NOLINT

int main() {
    int32_t x1, y1, x2, y2, x3, y3;
    cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3;
    auto d12 = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
    auto d23 = (x2 - x3) * (x2 - x3) + (y2 - y3) * (y2 - y3);
    auto d31 = (x3 - x1) * (x3 - x1) + (y3 - y1) * (y3 - y1);
    int32_t d;
    if (d12 == d23) {
        swap(x1, x2);
        swap(y1, y2);
        d = d12;
    } else if (d12 == d31) {
        d = d12;
    } else if (d23 == d31) {
        swap(x1, x3);
        swap(y1, y3);
        d = d23;
    } else {
        cout << -1 << endl;
        return 0;
    }
    auto cx21 = x2 - x1, cy21 = y2 - y1;
    auto cx31 = x3 - x1, cy31 = y3 - y1;
    if (cx21 * cx31 + cy21 * cy31 != 0) {
        cout << -1 << endl;
        return 0;
    }
    for (auto x = -500; x <= 500; ++x) {
        for (auto y = -500; y <= 500; ++y) {
            if (x == x1 && y == y1)
                continue;
            auto d42 = (x - x2) * (x - x2) + (y - y2) * (y - y2);
            auto d43 = (x - x3) * (x - x3) + (y - y3) * (y - y3);
            if (d42 == d && d43 == d) {
                cout << x << " " << y << endl;
                return 0;
            }
        }
    }
    cout << -1 << endl;
    return 0;
}