#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<list>
#include<queue>
#include<utility>
#include <fstream>
#include<set>
#include<map>
#include<cctype>
#include<cmath>
#include<algorithm>
using namespace std;


#define RALL(x) (x).rbegin(),(x).rend()
#define ALL(x) (x).begin(),(x).end()
#define repp(i,n) for(int (i)=1;(i)<=(n);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rev(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define clr(a) memset((a), 0 ,sizeof(a))
#define found(s,e) ((s).find(e)!=(s).end())

typedef pair<int,int> P;
typedef vector<pair<int,string> > pii;
typedef map<string,int> mdi;



int main(){
	vector<pair<int, int> > p(3);
	for(int i=0;i<3;i++)
		cin >> p[i].first >> p[i].second;
	sort(p.begin(),p.end());
	
	do{
		int dx=p[1].first-p[0].first;
		int dy=p[1].second-p[0].second;
		if(p[2].first-p[1].first==dy && p[2].second-p[1].second==-dx){
			int x=p[2].first-dx;
			int y=p[2].second-dy;
			cout << x << " " << y << endl;
			return 0;
		}
	}while(next_permutation(p.begin(),p.end()));
	
	cout << -1 << endl;
	return 0;
}