#include <cstdio>
#include <algorithm>

typedef std::pair<int,int> P;

P ps[4];

int main(){
    for(int i=0;i<3;i++){
        int x, y;
        scanf("%d %d", &x, &y);

        ps[i] = std::make_pair(x, y);
    }

    for(int i=0;i<6;i++){
        ps[3] = std::make_pair(ps[2].first - (ps[2].second - ps[1].second),
                               ps[2].second + (ps[2].first - ps[1].first));

        // printf("A: %d, %d\n", ps[3].first, ps[3].second);
        // for(int j=0;j<4;j++){
        //     printf("B: %d, %d\n", ps[j].first, ps[j].second);
        // }
        
        int dx = ps[1].first - ps[0].first,
            dy = ps[1].second - ps[0].second;
        int j;
        for(j=0;j<4;j++){
            if(ps[(j+1)%4].first - ps[j].first == dx &&
               ps[(j+1)%4].second - ps[j].second == dy){
                int _ = dx;
                dx = -dy;
                dy = _;
            }else{
                break;
            }
        }

        if(j == 4){printf("%d %d\n", ps[3].first, ps[3].second); return 0;}
        
        std::next_permutation(ps, ps+3);
    }

    puts("-1");
}