#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>

using namespace std;

int main() {
	vector<int> x(3, 0);
	vector<int> y(3, 0);

	for (int i = 0; i < 3; i++) {
		cin >> x[i] >> y[i];
	}

	for (int i = 0; i < 3; i++) {
		int j = (i + 1) % 3;
		int k = (i + 2) % 3;
		int dx_ji = x[j] - x[i];
		int dy_ji = y[j] - y[i];
		int dx_ki = x[k] - x[i];
		int dy_ki = y[k] - y[i];


		int cross_p = dx_ji * dx_ki + dy_ji * dy_ki;
		int len_ji2 = dx_ji * dx_ji + dy_ji * dy_ji;
		int len_ki2 = dx_ki * dx_ki + dy_ki * dy_ki;
		if (cross_p == 0 && len_ji2 == len_ki2) {
			int nx = x[k] + x[j] - x[i];
			int ny = y[k] + y[j] - y[i];
			cout << nx << " " << ny << endl;
			return 0;
		}
	}

	cout << -1 << endl;
	return 0;
}