#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;


int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    vector<int> x(3),y(3);
    for(int i=0;i<3;i++){
        cin >> x[i] >> y[i];
    }
    vector<int> v(3);
    iota(v.begin(), v.end(),0);
    do{
        int dx=x[v[1]]-x[v[0]];
        int dy=y[v[1]]-y[v[0]];
        if(x[v[1]]-dy==x[v[2]]&&y[v[1]]+dx==y[v[2]]){
            printf("%d %d\n",x[v[2]]-dx,y[v[2]]-dy );
            return 0;
        }
    }while(next_permutation(v.begin(), v.end()));
    printf("-1\n");
}