#include <iostream>
#include <utility>
#include <algorithm>
#include <vector>
using namespace std;
#define x first
#define y second
typedef pair<int,int> pi;
int main(){
	vector<pi> p(3);
	for(int i=0;i<3;i++)	cin>>p[i].x>>p[i].y;
	sort(p.begin(),p.end());
	do{
		pi v1,v2;
		v1.x=p[1].x-p[0].x;	v1.y=p[1].y-p[0].y;
		v2.x=p[2].x-p[0].x;	v2.y=p[2].y-p[0].y;
		if(((v1.x*v2.x)+(v1.y*v2.y)==0)&&((v1.x*v1.x)+(v1.y*v1.y)==(v2.x*v2.x)+(v2.y*v2.y))){
			pi ans;
			ans.x=p[0].x+v1.x+v2.x;
			ans.y=p[0].y+v1.y+v2.y;
			cout<<ans.x<<" "<<ans.y<<endl;
			return 0;
		}
	}while(next_permutation(p.begin(),p.end()));
	cout<<-1<<endl;
	return 0;
}