#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

struct coord { ll x, y; };

int main() {
  coord c[3]; rep(i,3) cin >> c[i].x >> c[i].y;
  rep(i,3) {
    int j = (i+1)%3, k = (i+2)%3;
    ll inner = (c[j].x-c[i].x)*(c[k].x-c[j].x)+(c[j].y-c[i].y)*(c[k].y-c[j].y);
    ll d1 = pow(c[j].x-c[i].x,2) + pow(c[j].y-c[i].y,2);
    ll d2 = pow(c[k].x-c[j].x,2) + pow(c[k].y-c[j].y,2);
    // cout << inner << endl;
    if (inner==0&&d1==d2) {
      coord result = {c[i].x+c[k].x-c[j].x, c[i].y+c[k].y-c[j].y};
      cout << result.x << " " << result.y << endl;
      return 0;
    }
  }
  cout << -1 << endl;
  return 0;
}