#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}

long long mod_exp(long long b, long long e, long long m) {
    if (e > 0 && b == 0) return 0;
    long long ans = 1;
    b %= m;

    while (e > 0) {
        if ((e & 1LL)) ans = (ans * b) % m;
        e = e >> 1LL;
        b = (b * b) % m;
    }

    return ans;
}


int main()
{

    int Q;
    Q = 1;
    //cin >> Q;
    
    

    while (Q--) {
        vector<int>x(3), y(3);
        int d[3] = { 0,1,2 };
        for (int i = 0; i < 3; i++)cin >> x[i] >> y[i];
        do {
            /*
            　回転後のＸ座標　＝　回転前のＸ座標　＊　cos(回転角度)　－　回転前のＹ座標　＊　sin(回転角度)

　            回転後のＹ座標　＝　回転前のＸ座標　＊　sin(回転角度)　＋　回転前のＹ座標　＊　cos(回転角度)
            */


            vector<int>X(3), Y(3);
            for (int i = 0; i < 3; i++) {
                X[i] = x[d[i]]; Y[i] = y[d[i]];
            }
            int dx = X[1] - X[0];
            int dy = Y[1] - Y[0];
            
            int nx = X[1] - dy;
            int ny = Y[1] + dx;

            if (X[2] != nx || Y[2] != ny)continue;

            nx = X[2] - dx;
            ny = Y[2] - dy;

            
            if (X[0] != nx+dy || Y[0] != ny-dx)continue;
            cout << nx << " " << ny;
            return 0;

        } while (next_permutation(d,d+3));
        cout << -1;
        
    }

    return 0;
}