#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)
#define tpl(...) make_tuple(__VA_ARGS__)
const int INF = 0x3f3f3f3f;
const double EPS = 1e-8;
const double PI = acos(-1);
typedef long long ll;
typedef pair<int,int> pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T>ostream&operator<<(ostream &o,const vector<T>&t){o<<'[';FOR(i,t){if(i!=t.begin())o<<',';o<<*i;}return o<<']';}
template<class S,class T>ostream&operator<<(ostream &o,const pair<S,T>&t){return o<<'('<<t.first<<','<<t.second<<')';}
template<int N,class Tp>void output(ostream&,const Tp&){}
template<int N,class Tp,class,class ...Ts>void output(ostream &o,const Tp&t){if(N)o<<',';o<<get<N>(t);output<N+1,Tp,Ts...>(o,t);}
template<class ...Ts>ostream&operator<<(ostream&o,const tuple<Ts...>&t){o<<'(';output<0,tuple<Ts...>,Ts...>(o,t);return o<<')';}
template<class T>void output(T t,char z=10){if(t<0)t=-t,putchar(45);int c[20];
int k=0;while(t)c[k++]=t%10,t/=10;for(k||(c[k++]=0);k;)putchar(c[--k]^48);putchar(z);}
template<class T>void outputs(T t){output(t);}
template<class S,class ...T>void outputs(S a,T...t){output(a,32);outputs(t...);}
template<class T>void output(T *a,int n){REP(i,n)cout<<a[i]<<(i!=n-1?',':'\n');}
template<class T>void output(T *a,int n,int m){REP(i,n)output(a[i],m);}
template<class T>bool input(T &t){int n=1,c;for(t=0;!isdigit(c=getchar())&&~c&&c-45;);
if(!~c)return 0;for(c-45&&(n=0,t=c^48);isdigit(c=getchar());)t=10*t+c-48;t=n?-t:t;return 1;}
template<class S,class ...T>bool input(S&a,T&...t){input(a);return input(t...);}

template<class T>
struct Pt {
  T x,y;
  Pt(T x=T(), T y=T()) :x(x),y(y) {}
  bool operator<(const Pt &p) const { return x!=p.x?x<p.x:y<p.y; }
  bool operator==(const Pt &p) const { return x==p.x&&y==p.y; }
  Pt operator+=(const Pt &p) { x+=p.x, y+=p.y; return *this; }
  Pt operator-=(const Pt &p) { x-=p.x, y-=p.y; return *this; }
  Pt operator*=(const Pt &p) { T t=x;x=x*p.x-y*p.y,y=t*p.y+y*p.x; return *this;}
  Pt operator*=(const T &v) { x*=v; y*=v; return *this;}
  friend ostream& operator<<(ostream& os, const Pt &p) {return os<<'('<<p.x<<','<<p.y<<')';}
  friend istream& operator>>(istream& is, Pt &p) {return is>>p.x>>p.y;}

  Pt operator+(const Pt &p) const { return Pt(*this)+=p; }
  Pt operator-(const Pt &p) const { return Pt(*this)-=p; }
  Pt operator*(const Pt &p) const { return Pt(*this)*=p; }
  Pt operator*(const T &v) const { return Pt(*this)*=v; }
  friend Pt operator*(const T &v, const Pt &p) { return p*v; }
  bool operator!=(const Pt &p) const { return !(*this == p); }

  T abs() const { return hypot(x,y); }
  T norm() const { return x*x+y*y; }
  T arg() const { return atan2(y,x); }
  T dot(const Pt &p) const { return x*p.x+y*p.y; }
  T det(const Pt &p) const { return x*p.y-y*p.x; }
  friend T abs(const Pt &p) { return p.abs(); }
  friend T norm(const Pt &p) { return p.norm(); }
  friend T arg(const Pt &p) { return p.arg(); }
  friend T dot(const Pt &p, const Pt &q) { return p.dot(q); }
  friend T det(const Pt &p, const Pt &q) { return p.det(q); }
};

typedef Pt<ll> P;

int main() {
  P p[3];
  while(cin>>p[0]>>p[1]>>p[2]) {
    P ans;
    bool ok = 0;
    REP(i,3) {
      vector<P> v;
      REP(j,3) {
        if (i!=j)
          v.push_back(p[j]-p[i]);
      }
      if (v[0].abs() == v[1].abs() && dot(v[0],v[1]) == 0) {
        ok = 1;
        ans = P(p[i]+v[0]+v[1]);
      }
    }
    if (ok) cout << ans.x << " " << ans.y << endl;
    else cout << -1 << endl;

  }
}