#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

typedef complex<int> Vec;

double dot(Vec a, Vec b) {
	return a.real() * b.real() + a.imag() * b.imag();
}

int cross(Vec a, Vec b) {
	return a.real() * b.imag() - a.imag() * b.real();
}

int main() {
	int x[3], y[3];
	REP(i, 3) scanf("%d %d", x + i, y + i);
	
	Vec p[3];
	REP(i, 3) p[i] = Vec(x[i], y[i]);
	
	int ord[3] = {0, 1, 2};
	do {
		Vec np[4];
		REP(i, 3) np[i] = p[ord[i]];
		
		np[3] = np[2] + np[0] - np[1];
		
		bool ng = false;
		ll now = 1;
		REP(i, 4) {
			Vec v1 = np[(i + 1) % 4] - np[i];
			Vec v2 = np[(i + 2) % 4] - np[i];
			if (cross(v1, v2) >= 0) ng = true;
		}
		
		FOR(i, 1, 4) {
			Vec v1 = np[(i + 1) % 4] - np[i];
			Vec v2 = np[1] - np[0];
			if (abs(abs(v1) - abs(v2)) > EPS) ng = true;
		}
		
		REP(i, 4) {
			Vec v1 = np[(i + 1) % 4] - np[i];
			Vec v2 = np[(i + 2) % 4] - np[(i + 1) % 4];
			if (dot(v1, v2) != 0) ng = true;
		}
		
		if (ng) continue;
		
		printf("%d %d\n", np[3].real(), np[3].imag());
		return 0;
		
	} while (next_permutation(ord, ord + 3));
	
	puts("-1");
	
	return 0;
}