import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd, log
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul, add
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce, lru_cache
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

X1, Y1, X2, Y2, X3, Y3 = MAP()

def isRightAngle(v1, v2):
	x1, y1 = v1
	x2, y2 = v2
	return x1*x2+y1*y2==0

def veclen(v):
	return hypot(v[0], v[1])

def vecsum(v1, v2):
	x1, y1 = v1
	x2, y2 = v2
	return (x1+x2, y1+y2)

def vecrev(v):
	return (-v[0], -v[1])

vec1 = (X1-X2, Y1-Y2)
vec2 = (X1-X3, Y1-Y3)
vec3 = (X2-X3, Y2-Y3)

if isRightAngle(vec1, vec2):
	if veclen(vec1) == veclen(vec2):
		for p1, p2 in product([vecsum((X2, Y2), vec2), vecsum((X2, Y2), vecrev(vec2))], [vecsum((X3, Y3), vec1), vecsum((X3, Y3), vecrev(vec1))]):
			if p1 == p2 and p1 != (X1, Y1):
				print(p1[0], p1[1])
				break
	else:
		print(-1)

elif isRightAngle(vec1, vec3):
	if veclen(vec1) == veclen(vec3):
		for p1, p2 in product([vecsum((X1, Y1), vec3), vecsum((X1, Y1), vecrev(vec3))], [vecsum((X3, Y3), vec1), vecsum((X3, Y3), vecrev(vec1))]):
			if p1 == p2 and p1 != (X2, Y2):
				print(p1[0], p1[1])
				break
	else:
		print(-1)

elif isRightAngle(vec2, vec3):
	if veclen(vec2) == veclen(vec3):
		for p1, p2 in product([vecsum((X2, Y2), vec2), vecsum((X2, Y2), vecrev(vec2))], [vecsum((X1, Y1), vec3), vecsum((X1, Y1), vecrev(vec3))]):
			if p1 == p2 and p1 != (X3, Y3):
				print(p1[0], p1[1])
				break
	else:
		print(-1)

else:
	print(-1)