#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define SZ(n) (int)(n).size()
#define ALL(n) (n).begin(), (n).end()
#define MOD 1000003
#define INF 100000000
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PI;


int main() {
	int x[3], y[3];
	REP(i, 3) cin >> x[i] >> y[i];
	int v[3] = { 0,1,2 };
	do {
		int a = x[v[1]] - x[v[0]];
		int b = y[v[1]] - y[v[0]];
		int c = x[v[2]] - x[v[0]];
		int d = y[v[2]] - y[v[0]];
		if (a * c + b * d == 0 && a * a + b * b == c * c + d * d) {
			cout << x[v[1]] + x[v[2]] - x[v[0]] << " " << y[v[1]] + y[v[2]] - y[v[0]] << endl;
			return 0;
		}
	} while (next_permutation(v, v + 3));
	cout << -1 << endl;
	return 0;
}