#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#include<regex>
#include<bitset>
#define rep(i,a) for(int i=(int)0;i<(int)a;++i)
#define pb push_back
#define eb emplace_back
using ll=long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 50;
 
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
using namespace std;

void solve(){
  vector<int>v(3);
  iota(v.begin(),v.end(),0);
  vector<int>x(3),y(3);
  rep(i,3)cin>>x[i]>>y[i];
  do{
    int dx=x[v[1]]-x[v[0]];
    int dy=y[v[1]]-y[v[0]];
    if(x[v[1]]-dy==x[v[2]]&&y[v[1]]+dx==y[v[2]]){
      cout<<x[v[2]]-dx<<" "<<y[v[2]]-dy<<"\n";
      return;
    }
  }while(next_permutation(v.begin(),v.end()));
  cout<<-1<<"\n";
}
 
int main(){
	ios::sync_with_stdio(false);
    cin.tie(0);
	cout<<fixed<<setprecision(15);
	solve();
	return 0;
}