#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define DECIM8  fixed<<setprecision(8) 
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))
typedef pair<int,int> PII;

PII addpii(PII a,PII b){ return MP(a.first+b.first,a.second+b.second); }
PII subpii(PII a,PII b){ return MP(a.first-b.first,a.second-b.second); }
PII rot(PII a)
{
  int x,y;
  tie(x,y)=a;
  return MP(-y,x);
}
PII p3_sq(PII a,PII b,PII c)
{
  if(rot(subpii(a,b))==subpii(a,c))
    return subpii(addpii(b,c),a);
  else return MP(10000,10000);
}
void printpii(PII a)
{
  cout << a.first << ' ' << a.second << endl;
}
int main(void)
{
  PII a,b,c,answer;
  cin >> a.first >> a.second;
  cin >> b.first >> b.second;
  cin >> c.first >> c.second;
  answer=p3_sq(a,b,c);
  if(answer.first!=10000){
    printpii(answer);
    return 0;
  }
  answer=p3_sq(a,c,b);
  if(answer.first!=10000){
    printpii(answer);
    return 0;
  }
  answer=p3_sq(b,a,c);
  if(answer.first!=10000){
    printpii(answer);
    return 0;
  }
  answer=p3_sq(b,c,a);
  if(answer.first!=10000){
    printpii(answer);
    return 0;
  }
  answer=p3_sq(c,a,b);
  if(answer.first!=10000){
    printpii(answer);
    return 0;
  }
  answer=p3_sq(c,b,a);
  if(answer.first!=10000){
    printpii(answer);
    return 0;
  }
  cout << -1 << endl;
  return 0;
}