#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const ll mod = 1e9+7;

int a[3] = {0, 1, 2};
int X[3], Y[3];
int main() {
    REP(i,0,3) {
        cin >> X[i] >> Y[i];
    }
    do{
        int dy = Y[a[1]] - Y[a[0]];
        int dx = X[a[1]] - X[a[0]];
        if (Y[a[2]] == Y[a[1]] + dx && X[a[2]] == X[a[1]] - dy){
            int Y3 = Y[a[2]] - dy;
            int X3 = X[a[2]] - dx;
            cout << X3 << " " << Y3 << endl;
            return 0;
        }
    }while(next_permutation(a, a+3));
    p(-1);
    return 0;
}