CF459A.Pashmak and Garden

Pashmak has fallen in love with an attractive girl called Parmida since one year ago...

Today, Pashmak set up a meeting with his partner in a romantic garden. Unfortunately, Pashmak has forgotten where the garden is. But he remembers that the garden looks like a square with sides parallel to the coordinate axes. He also remembers that there is exactly one tree on each vertex of the square. Now, Pashmak knows the position of only two of the trees. Help him to find the position of two remaining ones.

帕什马克一年前就爱上了名叫帕尔米达的一位漂亮女孩……

今天，帕什马克与他的伴侣在一座浪漫的花园中约会。不幸的是，帕什马克忘记了这座花园的位置。但他记得，这座花园呈正方形，且其四边均与坐标轴平行。他还记得，正方形的每个顶点上恰好有一棵树。现在，帕什马克只知道其中两棵树的位置。请帮助他找出另外两棵树的位置。

The first line contains four space-separated _x_1, _y_1, _x_2, _y_2 ( - 100 ≤ _x_1, _y_1, _x_2, _y_2 ≤ 100) integers, where _x_1 and _y_1 are coordinates of the first tree and _x_2 and _y_2 are coordinates of the second tree. It's guaranteed that the given points are distinct.

第一行包含四个以空格分隔的整数 $x_1,\ y_1,\ x_2,\ y_2$（$-100 \le x_1,\ y_1,\ x_2,\ y_2 \le 100$），其中 $x_1$ 和 $y_1$ 是第一棵树的坐标，$x_2$ 和 $y_2$ 是第二棵树的坐标。保证所给的两个点互不相同。

If there is no solution to the problem, print -1. Otherwise print four space-separated integers _x_3, _y_3, _x_4, _y_4 that correspond to the coordinates of the two other trees. If there are several solutions you can output any of them.

Note that _x_3, _y_3, _x_4, _y_4 must be in the range ( - 1000 ≤ _x_3, _y_3, _x_4, _y_4 ≤ 1000).

如果问题无解，输出 -1。否则输出四个以空格分隔的整数 $x_3,\ y_3,\ x_4,\ y_4$，分别表示另外两棵树的坐标。若存在多个解，输出任意一个即可。

注意：$x_3,\ y_3,\ x_4,\ y_4$ 必须满足范围 $-1000 \le x_3,\ y_3,\ x_4,\ y_4 \le 1000$。