Problem:
Score : 200 points

Problem Statement

There is a square in the xy-plane. The coordinates of its four vertices are (x_1,y_1),(x_2,y_2),(x_3,y_3) and (x_4,y_4) in counter-clockwise order.
(Assume that the positive x-axis points right, and the positive y-axis points up.)

Takahashi remembers (x_1,y_1) and (x_2,y_2), but he has forgot (x_3,y_3) and (x_4,y_4).

Given x_1,x_2,y_1,y_2, restore x_3,y_3,x_4,y_4. It can be shown that x_3,y_3,x_4 and y_4 uniquely exist and have integer values.

Constraints

|x_1|,|y_1|,|x_2|,|y_2| \leq 100

(x_1,y_1) ≠ (x_2,y_2)

All values in input are integers.

Input

Input is given from Standard Input in the following format:

x_1 y_1 x_2 y_2

Output

Print x_3,y_3,x_4 and y_4 as integers, in this order.

Sample Input 1

0 0 0 1

Sample Output 1

-1 1 -1 0

(0,0),(0,1),(-1,1),(-1,0) is the four vertices of a square in counter-clockwise order.
Note that (x_3,y_3)=(1,1),(x_4,y_4)=(1,0) is not accepted, as the vertices are in clockwise order.

Sample Input 2

2 3 6 6

Sample Output 2

3 10 -1 7

Sample Input 3

31 -41 -59 26

Sample Output 3

-126 -64 -36 -131

Solution in C (GCC 9.2.1) (judge verdict: Accepted)

/* ex 7_1
   KitamoriFumiya */
 
#include <stdio.h>
 
// 頂点の構造体を作る
typedef struct point{
	int x_elem;
	int y_elem;
}point;
 
// ある頂点をx軸,y軸について移動させた頂点を返す関数
point shift_point(point move_vertex, point center_vertex){
	point next_vertex; // 移動させた頂点
	next_vertex.x_elem = move_vertex.y_elem - center_vertex.y_elem + center_vertex.x_elem;
	next_vertex.y_elem = -(move_vertex.x_elem - center_vertex.x_elem) + center_vertex.y_elem;
	
	return next_vertex;
}
 
int main(){
	point vertex1, vertex2, vertex3, vertex4;
	// 頂点1,2を入力
	scanf("%d %d %d %d", &vertex1.x_elem, &vertex1.y_elem, &vertex2.x_elem, &vertex2.y_elem);
	// 頂点3を求めて出力（改行せず）
	vertex3 = shift_point(vertex1, vertex2);
	printf("%d %d", vertex3.x_elem, vertex3.y_elem);
	// 頂点4を求めて出力（最後に改行）
	vertex4 = shift_point(vertex2, vertex3);
	printf(" %d %d\n", vertex4.x_elem, vertex4.y_elem);
	
	return 0;
}