#include<iostream>
#include<math.h>
#include<vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) //printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

pos p1, p2, p3;

int len(pos p1, pos p2) {
    return pow(p1.*x - p2.*x, 2) + pow(p1.*y - p2.*y, 2);
}

signed main()
{
    vector<pos> p(3);
    REP(i,3) cin >> p[i].*x >> p[i].*y;
    do {
        vector<pos> vec(2);
        REP(i,2) {
            vec[i].*x = p[i+1].*x - p[0].*x;
            vec[i].*y = p[i+1].*y - p[0].*y;
        }
        pos q;
        q.*x = p[0].*x - vec[0].*y;
        q.*y = p[0].*y + vec[0].*x;
        // p[2]と比較
        if (p[2].*x != q.*x || p[2].*y != q.*y) continue;
        // 内積が0でない: 90°じゃないならスキップ
        if (vec[0].*x * vec[1].*x + vec[0].*y * vec[1].*y != 0) continue;
        // 4番目の座標を求める
        int x = p[1].first + vec[1].first;
        int y = p[1].second + vec[1].second;
        cout << x << " " << y << endl;
        return 0;
    } while (next_permutation(ALL(p)));

    cout << -1 << endl;

    return 0;
}