#include <iostream>
#include <vector>
#include <string>
#include <list>
#include <map>
#include <queue>
#include <algorithm>
#define rep(i, n) for(i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define INF 1 << 30

using namespace std;
typedef long long ll;
typedef pair<int, int> pp;

int Search(map<int, int> & mp) {
	for (auto it = mp.begin(); it != mp.end(); it++) {
		if ((*it).second == 1) {
			return (*it).first;
		}
	}
}

int main(void) {
	int num, i, a, b;
	map<int, int> x, y;
	rep(i, 3) {
		cin >> a >> b;
		x[a]++;
		y[b]++;
	}
	if (x.size() != 2 || y.size() != 2)
		printf("-1\n");
	else {
		cout << Search(x) << " ";
		cout << Search(y) << "\n";
	}
	return 0;
}