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

using ll = long long;
#define rep(i, n) for(int i = 0; i < n; i++)

int main() {
	vector<int> x(3), y(3), idx{0, 1, 2};
	rep(i, 3) cin >> x[i] >> y[i];
	do {
		int dx1 = x[idx[1]] - x[idx[0]];
		int dy1 = y[idx[1]] - y[idx[0]];
		int dx2 = x[idx[2]] - x[idx[1]];
		int dy2 = y[idx[2]] - y[idx[1]];
		int dx3 = x[idx[0]] - x[idx[2]];
		int dy3 = y[idx[0]] - y[idx[2]];
		int ls1 = dx1 * dx1 + dy1 * dy1;
		int ls2 = dx2 * dx2 + dy2 * dy2;
		if(ls1 + ls2  == dx3 * dx3 + dy3 * dy3 && ls1 == ls2) {
			complex<int> o(x[idx[2]], y[idx[2]]), v(dx1, dy1), t;
			t = o - v;
			cout << t.real() << " " << t.imag() << endl;
			return 0;
		}
	} while(next_permutation(idx.begin(), idx.end()));
	cout << -1 << endl;
}