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

#include <stdio.h>

typedef struct point{  // xy座標
    int x_elem;
    int y_elem;
}point;

point shift_point(point vertice1, point vertice2);  // プロトタイプ宣言

int main(void){
    point vertice1, vertice2, vertice3, vertice4;
    scanf(
        "%d %d %d %d", &vertice1.x_elem, &vertice1.y_elem,
        &vertice2.x_elem, &vertice2.y_elem
    );
    // 反時計回りに順にvertice3とvertice4を求める
    vertice3 = shift_point(vertice1, vertice2);
    vertice4 = shift_point(vertice2, vertice3);
    printf(
        "%d %d %d %d", vertice3.x_elem, vertice3.y_elem,
        vertice4.x_elem, vertice4.y_elem
    );
    return 0;
}

// 既知の頂点から次の頂点を求める関数
point shift_point(point vertice1, point vertice2){
    point new_vertice;
    new_vertice.x_elem = vertice2.x_elem - (vertice2.y_elem - vertice1.y_elem);
    new_vertice.y_elem = vertice2.y_elem + (vertice2.x_elem - vertice1.x_elem);
    return new_vertice;
}