#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <stack>
#include <utility>
#include <time.h>
//#include "util.h"

using namespace std;
typedef long long ll;
typedef unsigned long long ull;

#define PI 3.14159265358979323846
#define EPS 1e-6
#define MOD ((ll)1000000007)
#define MIN(a,b) ((a)<(b)?(a):(b))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define CHAR_BIT 8

template <typename _Ty>
ostream& operator << (ostream& ostr, const vector<_Ty>& v) {
	if (v.empty()) {
		cout << "{ }";
		return ostr;
	}
	cout << "{" << v.front();
	for (auto itr = ++v.begin(); itr != v.end(); itr++) {
		cout << ", " << *itr;
	}
	cout << "}";
	return ostr;
}

int yuki0055()
{
	int x[4], y[4], d[3];
	for (int i = 0; i < 3; i++)
		cin >> x[i] >> y[i];
	//距離(の2乗)算出
	for (int i = 0; i < 3; i++)
		d[i] = (x[(i + 1) % 3] - x[(i + 2) % 3]) * (x[(i + 1) % 3] - x[(i + 2) % 3]) + (y[(i + 1) % 3] - y[(i + 2) % 3]) * (y[(i + 1) % 3] - y[(i + 2) % 3]);
	//二等辺三角形かどうか？
	if (d[0] != d[1] && d[1] != d[2] && d[2] != d[0]) {
		cout << -1 << endl;
		return 0;
	}


	for (int i = 0; i < 3; i++) {
		//二等辺なら
		if (d[i] == d[(i + 1) % 3]) {
			//内積算出
			int vx[2], vy[2], inner_product;
			vx[0] = x[(i + 1) % 3] - x[(i + 2) % 3]; vy[0] = y[(i + 1) % 3] - y[(i + 2) % 3];
			vx[1] = x[i] - x[(i + 2) % 3]; vy[1] = y[i] - y[(i + 2) % 3];
			inner_product = vx[0] * vx[1] + vy[0] * vy[1];
			//直角二等辺三角形かどうか？
			if (inner_product != 0) {
				cout << -1 << endl;
				return 0;
			}
			x[3] = x[i] + x[(i + 1) % 3] - x[(i + 2) % 3];
			y[3] = y[i] + y[(i + 1) % 3] - y[(i + 2) % 3];
			cout << x[3] << " " << y[3] << endl;
			return 0;
		}
	}
	return -1;
}

int main()
{
	//clock_t start, end;
	//start = clock();

	yuki0055();

	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}