#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
    
    int X[3], Y[3];
    for ( int i = 0; i < 3; i++ ) {
        cin >> X[i] >> Y[i];
    }
    vector<int> V = {0,1,2};
    
    do {
        
        int d1 = ( X[V[0]]-X[V[1]] ) * ( X[V[0]]-X[V[1]] ) + ( Y[V[0]]-Y[V[1]] ) * ( Y[V[0]]-Y[V[1]] );
        int d2 = ( X[V[1]]-X[V[2]] ) * ( X[V[1]]-X[V[2]] ) + ( Y[V[1]]-Y[V[2]] ) * ( Y[V[1]]-Y[V[2]] );
        
        if ( d1 != d2 )  { continue; }
        
        int ip = ( X[V[0]]-X[V[1]] ) * ( X[V[1]]-X[V[2]] ) + ( Y[V[0]]-Y[V[1]] ) * ( Y[V[1]]-Y[V[2]] );
        
        if ( ip != 0 ) { continue; }
        
        int x = X[V[2]] + X[V[0]]-X[V[1]];
        int y = Y[V[2]] + Y[V[0]]-Y[V[1]];
         if ( x + X[V[1]]-X[V[2]] == X[V[0]] && y + Y[V[1]]-Y[V[2]] == Y[V[0]] ) {
             cout << x << " " << y << endl; return 0;
         }
        
    } while ( next_permutation( V.begin(), V.end() ) );
    
    cout << -1 << endl;
    
    return 0;
}