#include <iostream>
#include <complex>
#include <algorithm>
using namespace std;

typedef complex<int> P;
const P rot(0, 1);

bool check(P p0, P p1, P p2){
    P d = p1 - p0;
    
    d *= rot;
    if(p1 + d != p2)return false;
    
    d *= rot;
    P p3 = p2 + d;
    
    d *= rot;
    if(p3 + d != p0)return false;
    
    cout << p3.real() << " " << p3.imag() << endl;
    return true;
}

P ps[3];
int id[3];
int main(){
    for(int i=0;i<3;i++){
        int x, y;
        cin >> x >> y;
        ps[i] = P(x, y);
        id[i] = i;
    }
    
    bool found = false;
    do {
        if(check(ps[id[0]], ps[id[1]], ps[id[2]])){
            found = true;
            break;
        }
    } while(next_permutation(id, id + 3));
    
    if(!found){
        cout << -1 << endl;
    }
    
    return 0;
}