#include using namespace std; typedef long long ll; #define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++) #define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++) #define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--) #define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--) #define all(x) (x).begin(), (x).end() #define sz(x) ((ll)(x).size()) #define len(x) ((ll)(x).length()) double f(pair xy1, pair xy2) { ll dx = xy1.first - xy2.first; ll dy = xy1.second - xy2.second; return sqrt(dx * dx + dy * dy); } int main() { cin.tie(0); ios::sync_with_stdio(false); // ifstream in("input.txt"); // cin.rdbuf(in.rdbuf()); vector> xy(4); rep(i, 3) cin >> xy[i].first >> xy[i].second; reps(x, -100, 101) { reps(y, -100, 101) { bool ng = false; rep(i, 3) { if ((xy[i].first == x) && (xy[i].second == y)) { ng = true; break; } } if (ng) continue; double d = -1; xy[3].first = x; xy[3].second = y; rep(i, 4) { map cnt; ll mv = 0; rep(j, 4) { if (i == j) continue; double p = f(xy[i], xy[j]); cnt[p]++; mv = max(mv, cnt[p]); } if (mv < 2) { ng = true; break; } for(auto x : cnt) { if (x.second == mv) { if (d == -1) { d = x.first; } else if (d != x.first) { ng = true; break; } } } } if (!ng) { printf("%lld %lld\n", x, y); return 0; } } } printf("-1\n"); return 0; }