#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000

typedef pair<int, int> P;

int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
	int x[3], y[3];
	rep(i, 3) cin >> x[i] >> y[i];
	vector<P> v;
	rep(i, 3) v.push_back({ x[i], y[i] });
	sort(v.begin(), v.end());
	do{
		int dx = v[1].first - v[0].first;
		int dy = v[1].second - v[0].second;
		int xx = v[0].first;
		int yy = v[0].second;
		vector<P> mv;
		rep(i, 4) {
			mv.push_back({ xx, yy });
			xx += dx;
			yy += dy;
			swap(dx, dy);
			dy = -dy;
		}
		set<P> st;
		rep(i, 4) st.insert(mv[i]);
		rep(i, 3) st.insert(v[i]);
		if (st.size() == 4) {
			rep(i, 4) {
				bool flag = true;
				rep(k, 3) {
					if (mv[i] == v[k]) {
						flag = false;
						break;
					}
				}
				if (flag) {
					cout << mv[i].first << " " << mv[i].second << endl;
					return 0;
				}
			}
		}
	} while (next_permutation(v.begin(), v.end()));
	cout << -1 << endl;





    return 0;
}