#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = (ll)(1e+9) + 7;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
map<P, bool> mp;
int main() {
	int x[3], y[3];
	rep(i, 3) {
		cin >> x[i] >> y[i];
		x[i] <<= 1; y[i] <<= 1;
		mp[{x[i], y[i]}] = true;
	}
	int ax, ay;
	bool ansed = false;
	rep(i, 3) {
		rep(j, 3) {
			if (x[i] == x[j]&&y[i]==y[j])continue;
			int mx = x[i] + x[j];
			int my = y[i] + y[j];
			mx /= 2; my /= 2;
			int dx = -(y[i] - my);
			int dy = x[i] - mx;
			if (mp[{mx + dx, my + dy}]) {
				ansed = true;
				ax = mx - dx; ay = my - dy;
				break;
			}
			dx = -dx; dy = -dy;
			if (mp[{mx + dx, my + dy}]) {
				ansed = true;
				ax = mx - dx; ay = my - dy;
				break;
			}
		}
		if (ansed)break;
	}
	if (!ansed)cout << -1 << endl;
	else cout << ax/2 << " " << ay/2 << endl;
	return 0;
}