#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cstring>

typedef long long ll;
using namespace std;

#define mod 1000003
#define INF 1000000000
#define LLINF 2000000000000000000LL

#define SIZE 100

int main(){
    int x[3],y[3];
    int dx[3],dy[3];
    int ansx,ansy;
    bool f;
    
    for(int i=0;i<3;i++)
        scanf("%d%d",&x[i],&y[i]);
    
    for(int i=0;i<3;i++){
        dx[i] = x[i]-x[(i+1)%3];
        dy[i] = y[i]-y[(i+1)%3];
    }
    
    for(int i=0;i<3;i++){
        if(abs(dx[i])==abs(dy[(i+1)%3]) && abs(dy[i])==abs(dx[(i+1)%3])){
            
            ansx = x[(i+2)%3]+dx[i];
            ansy = y[(i+2)%3]+dy[i];
            f = true;
            
            for(int i=0;i<3;i++){
                if(x[i]==ansx && y[i]==ansy)
                    f = false;
            }
            
            if(f){
                printf("%d %d\n",ansx,ansy);
                return 0;
            }
            
        }
    }
    
    puts("-1");
    
    return 0;
}