#include "bits/stdc++.h"
using namespace std;
#define fastcin {\
    cin.tie(0);\
    ios::sync_with_stdio(false);\
}
#define rep(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, a, b) for(int i = a; i >= b; i--)
#define fore(i, a) for(auto &i:a)
#define print(x) cout << x << "\n"
#define SORT(a, n) sort(a, a+n);
#define REVERSE(a,n) reverse(a,a+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VREVERSE(v) reverse(v.begin(), v.end());
#define MOD 1000000007
#define yes "YES"
#define no "NO"
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;

struct xy
{
    int x;
    int y;
    bool operator<(const xy& another) const {
        if(x != another.x) {
            return x < another.x;
        } 
        return y < another.y;
    }
};
int main() {
    fastcin;
    xy c[3];
    rep(i, 0, 3) {
        cin >> c[i].x >> c[i].y;
    }
    int d[3];
    int dx, dy, x, y, a;
    d[0] = pow(c[1].x-c[0].x, 2) + pow(c[1].y-c[0].y, 2);
    d[1] = pow(c[2].x-c[1].x, 2) + pow(c[2].y-c[1].y, 2);
    d[2] = pow(c[0].x-c[2].x, 2) + pow(c[0].y-c[2].y, 2);
    if(!d[0]||!d[1]||!d[2]) printf("-1\n");
    else if(d[0]==d[1]) {
        if(d[0]+d[1]==d[2]) {
            dx = c[2].x-c[1].x;
            dy = c[2].y-c[1].y;
            x = c[2].x+dy;
            y = c[2].y-dx;
            a = pow(c[1].x-x, 2) + pow(c[1].y-y, 2);
            if(a!=d[2]) {
                x = c[2].x-dy;
                y = c[2].y+dx;
            }
            printf("%d %d\n", x, y);
        }
    } else if(d[1]==d[2]) {
        if(d[1]+d[2]==d[0]) {
            dx = c[0].x-c[2].x;
            dy = c[0].y-c[2].y;
            x = c[0].x+dy;
            y = c[0].y-dx;
            a = pow(c[2].x-x, 2) + pow(c[2].y-y, 2);
            if(a!=d[0]) {
                x = c[0].x-dy;
                y = c[0].y+dx;
            }
            printf("%d %d\n", x, y);
        }
    } else if(d[2]==d[0]) {
        if(d[2]+d[0]==d[1]) {
            dx = c[2].x-c[0].x;
            dy = c[2].y-c[0].y;
            x = c[2].x+dy;
            y = c[2].y-dx;
            a = pow(c[0].x-x, 2) + pow(c[0].y-y, 2);
            if(a!=d[1]) {
                x = c[2].x-dy;
                y = c[2].y+dx;
            }
            printf("%d %d\n", x, y);
        }
    } else printf("-1\n");
    return 0;
}