#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<math.h>
#include<bitset>
using ll = long long;
using namespace std;

int main(){
    int a, b, c, d, e, f, g, h, s1, s2, s3;
    cin >> a >> b >> c >> d >> e >> f;
    s1 = (a - c)*(a - c) + (b -d)*(b -d);
    s2 = (c - e)*(c - e) + (d -f)*(d -f);
    s3 = (e - a)*(e - a) + (f - b)*(f - b);
    if (((s1 + s2 != s3) && (s2 + s3 != s1) && (s1 + s3 != s2)) || !((s1 == s2) || (s1 == s3) || (s2 == s3))){
        cout << -1 << endl;
        return 0;
    } else {
        if (s1 + s2 == s3){
            g = a + e - c;
            h = b + f - d;
        } else if (s1 + s3 == s2){
            g = c + e - a;
            h = d + f - b;
        } else {
            g = a + c - e;
            h = b + d - f; 
        }
    }
    cout << g << " " << h << endl; 
}