#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=(r)-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,-1,0,1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
ll dist(ll x,ll y,ll z,ll a){
    return (x-z)*(x-z)+(y-a)*(y-a);
}
int main(){
    vl x(3),y(3);
    rep(i,3)cin >> x[i] >> y[i];
    vl z;
    rep(i,3)repl(j,i+1,3)z.pb(dist(x[i],y[i],x[j],y[j]));
    sort(all(z));
    if(z[0]==z[1]&&z[1]*2==z[2]){
        rep(i,1000)rep(j,1000){
            ll nx=i-500,ny=j-500;
            vl zz;
            rep(k,3)zz.pb(dist(x[k],y[k],nx,ny));
            sort(all(zz));
            if(z==zz){
                cout << nx <<" " << ny <<endl;
                return 0;
            }
        }
    }
    else cout << -1 <<endl;
}