p = map(int,raw_input().split())
def sub_v(i,j):
	return (p[j]-p[i],p[j+1]-p[i+1])
def in_p(v1,v2):
	return v1[0]*v2[0]+v1[1]*v2[1]
def sq_d(i,j):
	return (p[i]-p[j])**2+(p[i+1]-p[j+1])**2
v = [sub_v(i*2,(i+1)%3*2) for i in xrange(3)]
d = [sq_d(i*2,(i+1)%3*2) for i in xrange(3)]
for i in xrange(3):
	j = (i+1)%3
	if in_p(v[i],v[j]) == 0 and d[i] == d[j]:
		print p[2*i]+v[j][0],p[2*i+1]+v[j][1]
		break
else:
	print -1