x1, y1, x2, y2, x3, y3 = map(int, input().split())

zahyo = [(x1, y1),
         (x2, y2),
         (x3, y3)]

def dist(t1, t2):
    return (t1[0] - t2[0])**2 + (t1[1] - t2[1])**2

def naiseki(t1, t2):
    return t1[0]*t2[0] + t1[1]*t2[1]

for i in range(3):
    x11, y11 = zahyo[i]
    x22, y22 = zahyo[(i + 1)%3]
    x33, y33 = zahyo[(i + 2)%3]

    v1 = (x22 - x11, y22 - y11)
    v2 = (x33 - x11, y33 - y11)

    # v1とv2が直行するか？
    # |v1| == |v2| か？
    if naiseki(v1, v2) == 0 and dist((x11, y11), (x22, y22)) == dist((x11, y11), (x33, y33)):
        ans1 = x22 + x33 - x11
        ans2 = y22 + y33 - y11
        exit(print(ans1, ans2))
print(-1)