#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double eps = 1e-10;

pll x[3];
int d2(pii&a, pii&b){
  return (a.fi - b.fi) * (a.fi - b.fi) + (a.se - b.se) * (a.se - b.se);
}
bool isperp(pii&a, pii&b, pii&c, pii&d){
  return (a.fi - b.fi) * (c.fi - d.fi) + (a.se - b.se) * (c.se - d.se) == 0;
}
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  FOR(i, 0, 3){
    int a, b;
    cin >> a >> b;
    x[i] = pii(a, b);
  }
  pii a = x[0], b = x[1], c = x[2];
  if(isperp(a, b, b, c)){
    ;
  }else if(isperp(b, a, a, c)){
    swap(a, b);
  }else if(isperp(a, c, c, b)){
    swap(b, c);
  }else{
    cout << -1 << endl;
    return 0;
  }
  if(d2(a, b) != d2(b, c)){
    cout << -1 << endl;
    return 0;
  }
  cout << c.fi + a.fi - b.fi << " " << c.se + a.se - b.se << endl;
}