#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

#include<set>
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n = 3;
    vector<int> x(n),y(n);
    for(int i = 0;i<n;i++) cin>>x[i]>>y[i];
    bool fn = true;
    int nx,ny;
    if(x[0]==x[1]) nx = x[2];
    else if(x[1]==x[2]) nx = x[0];
    else if(x[0]==x[2]) nx = x[1];
    else fn = false;
    if(y[0]==y[1]) ny = y[2];
    else if(y[1]==y[2]) ny = y[0];
    else if(y[0]==y[2]) ny = y[1];
    else fn = false;
    set<int> sx,sy;
    for(int i = 0;i<n;i++) sx.insert(x[i]);
    for(int i = 0;i<n;i++) sy.insert(y[i]);
    sx.insert(nx);
    sy.insert(ny);
    if(sx.size()!=2) fn = false;
    if(sy.size()!=2) fn = false;

    int dx,dy;
    for(int i = 0;i<n;i++) for(int j = 0;j<n;j++) if(x[i]!=x[j]) dx = abs(x[i]-x[j]);
    for(int i = 0;i<n;i++) for(int j = 0;j<n;j++) if(y[i]!=y[j]) dy = abs(y[i]-y[j]);
    if(dx!=dy) fn = false;
    if(fn) cout<<nx<<" "<<ny<<endl;
    else cout<<-1<<endl;

}