#include <iostream>
#include <algorithm>
#include <vector>

template <class T>
T sq(T x) { return x * x; }

void solve() {
    std::vector<std::pair<int, int>> ps(3);
    for (auto& p : ps) std::cin >> p.first >> p.second;

    for (int q = 0; q < 6; ++q) {
        std::vector<std::pair<int, int>> ds(2);
        for (int i = 0; i < 2; ++i) {
            ds[i].first = ps[i + 1].first - ps[i].first;
            ds[i].second = ps[i + 1].second - ps[i].second;
        }

        if (ds[0].first * ds[1].first + ds[0].second * ds[1].second == 0 &&
            sq(ds[0].first) + sq(ds[0].second) == sq(ds[1].first) + sq(ds[1].second)) {
            std::cout << ps[2].first - ds[0].first << " "
                      << ps[2].second - ds[0].second << std::endl;
            return;
        }

        std::next_permutation(ps.begin(), ps.end());
    }

    std::cout << -1 << std::endl;
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}