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
   potter0723sw */

#include <stdio.h>

typedef struct point{
    int x_elem;
    int y_elem;
}point;

point shift_point(point pre, int x_shift, int y_shift){
    point post;
    post.x_elem = pre.x_elem + x_shift;
    post.y_elem = pre.y_elem + y_shift;
    return post;
}

int main(void){
    int dif_x, dif_y;
    point point_a, point_b, point_c, point_d;
    scanf("%d %d %d %d", &point_a.x_elem, &point_a.y_elem, &point_b.x_elem, &point_b.y_elem);
    dif_x = point_a.x_elem - point_b.x_elem;//aからbへのx座標の動き
    dif_y = point_a.y_elem - point_b.y_elem;//y座標の動き
    point_c = shift_point(point_b, dif_y, -dif_x);//３つ目の頂点は２つ目からx方向にdif_y,y方向に-dif_x動けば良い 
    point_d = shift_point(point_a, dif_y, -dif_x);//４つ目は１つ目から上と同じ動きをすれば良い
    printf("%d %d %d %d\n", point_c.x_elem, point_c.y_elem, point_d.x_elem, point_d.y_elem);
    return 0;
}