import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy

xy = list(map(int, input().split()))


def is_square(square_x, square_y):
    square_v = []
    for i in range(4):
        for j in range(i + 1, 4):
            dx = square_x[i] - square_x[j]
            dy = square_y[i] - square_y[j]
            square_v.append(dx ** 2 + dy ** 2)
    square_v.sort()
    l = square_v[0]
    return square_v[0] == l and square_v[1] == l and square_v[2] == l and square_v[3] == l and square_v[4] == l * 2 and square_v[5] == l * 2
    

x = [0] * 4
y = [0] * 4

for i in range(3):
    x[i] = xy[i + i * 1]
    y[i] = xy[i + 1 * (i + 1)]

flag = False
for i in range(-200, 201):
    if flag:
        break
    for j in range(-200,201):
        x[3] = i
        y[3] = j
        if is_square(x,y):
            flag = True
            print(i,j)
            break
if flag == False:
    print(-1)