#include #define EPS 1e-9 #define INF 1070000000LL #define MOD 1000000007LL #define fir first #define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++) #define numa(x,a) for(auto x: a) #define ite iterator #define mp make_pair #define mt make_tuple #define rep(i,n) rep2(i,0,n) #define rep2(i,m,n) for(int i=m;i<(n);i++) #define pb push_back #define pf push_front #define sec second #define sz(x) ((int)(x).size()) #define ALL( c ) (c).begin(), (c).end() #define gcd(a,b) __gcd(a,b) #define mem(x,n) memset(x,n,sizeof(x)) #define endl "\n" using namespace std; template void deploy(std::ostream &os, const TUPLE &tuple){} template void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get(t); deploy(os, t); } template std::ostream& operator<<(std::ostream &os, std::pair &v){os << "(" << v.first << ", " << v.second << ")"<< endl; } template std::ostream& operator<<(std::ostream &os, std::vector &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; } template std::ostream& operator<<(std::ostream &os, std::set &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; } template std::ostream& operator<<(std::ostream &os, std::map &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; } #define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; } #define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); } #define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); } #define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); } using ll = long long; int dist(pair v1,pair v2){ return (v1.fir-v2.fir) * (v1.fir-v2.fir) + (v1.sec-v2.sec) * (v1.sec-v2.sec); } bool is_square(vector > vs){ sort(ALL(vs)); vector > > ds; rep2(i,1,sz(vs)){ ds.pb(mp(dist(vs[0],vs[i]),mp(vs[i].fir-vs[0].fir,vs[i].sec-vs[0].sec))); } if(ds[0].fir == ds[1].fir){ if(ds[0].fir * 2 == ds[2].fir){ if(ds[0].sec.fir * ds[1].sec.fir + ds[0].sec.sec * ds[1].sec.sec == 0){ int tmp = ds[0].sec.fir * ds[2].sec.fir + ds[0].sec.sec * ds[2].sec.sec; if(2*tmp*tmp == ds[0].fir * ds[2].fir){ return true; } } } } return false; } int main(){ cin.tie(0); ios_base::sync_with_stdio(0); vector > vs; rep(i,3){ int x,y; cin >> x >> y; vs.pb(mp(x,y)); } for(int x = -100;x <= 100;x++){ for(int y = -100;y <= 100;y++){ vs.pb(mp(x,y)); if(is_square(vs)){ cout << x <<" " << y << endl; return 0; } vs.pop_back(); } } cout << -1 << endl; return 0; }