#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int dist(int a, int b, int c, int d){
    return abs(a-c)*abs(a-c) + abs(b-d)*abs(b-d);
}

int main() {
    int a, b, c, d, e, f;
    cin >> a >> b >> c >> d >> e >> f;
    srep(i,1000,1000){
        srep(j,-1000,1000){
            if(dist(a,b,c,d) == dist(a,b,e,f) && dist(a,b,e,f) == dist(c,d,i,j) && dist(a,b,e,f) == dist(e,f,i,j)){
                cout << i << ' ' << j << endl;
                return 0;
            }
            if(dist(a,b,c,d) == dist(c,d,e,f) && dist(c,d,e,f) == dist(a,b,i,j) && dist(c,d,e,f) == dist(e,f,i,j)){
                cout << i << ' ' << j << endl;
                return 0;
            }
            if(dist(e,f,c,d) == dist(a,b,e,f) && dist(a,b,e,f) == dist(c,d,i,j) && dist(a,b,e,f) == dist(a,b,i,j)){
                cout << i << ' ' << j << endl;
                return 0;
            }
        }
    }
    cout << -1 << endl;
    return 0;
}