#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef pair<int, int> P;
typedef unsigned int uint;
typedef unsigned long long ull;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};

const int inf = 1000000009;
const double eps = 1e-8;

inline int length(int x1, int y1, int x2, int y2) {
    return (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
}

inline bool perp(int x1, int y1, int x2, int y2, int x3, int y3) {
    return (x2 - x1) * (x3 - x1) + (y2 - y1) * (y3 - y1) == 0;
}

string solve(int x1, int y1, int x2, int y2, int x3, int y3) {
    int l12 = length(x1, y1, x2, y2), l23 = length(x2, y2, x3, y3), l31 = length(x3, y3, x1, y1);
    stringstream ss;
    if (l12 == l31 && perp(x1, y1, x2, y2, x3, y3)) {
	ss << x3 + (x2 - x1) << " " << y3 + (y2 - y1);
    } else if (l12 == l23 && perp(x2, y2, x1, y1, x3, y3)) {
	ss << x3 + (x1 - x2) << " " << y3 + (y1 - y2);
    } else if (l31 == l23 && perp(x3, y3, x1, y1, x2, y2)) {
	ss << x1 + (x2 - x3) << " " << y1 + (y2 - y3);
    } else {
	ss << -1;
    }
    return ss.str();
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    int x1, y1, x2, y2, x3, y3;
    cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3;
    cout << solve(x1, y1, x2, y2, x3, y3) << endl;
}