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

#include <stdio.h>
#include <string.h>

//頂点を表す構造体point
typedef struct point{
    int x_elem;
    int y_elem;
}point;

//頂点pre_pointをx軸にx_diff,y軸にy_diffだけ移動した頂点を返す
point shift_point(point pre_point,int x_diff,int y_diff){
    pre_point.x_elem+=x_diff;
    pre_point.y_elem+=y_diff;
    return pre_point;
}


int main(void){
    //point型4頂点の宣言と頂点1,2の入力
    point angle1,angle2,angle3,angle4;
    scanf("%d %d %d %d",&angle1.x_elem,&angle1.y_elem,&angle2.x_elem,&angle2.y_elem);
    //頂点1,2の位置から頂点3,4の位置を計算し、代入
    angle3=shift_point(angle2,angle1.y_elem-angle2.y_elem,angle2.x_elem-angle1.x_elem);
    angle4=shift_point(angle3,angle2.y_elem-angle3.y_elem,angle3.x_elem-angle2.x_elem);
    //頂点3,4の出力
    printf("%d %d %d %d\n",angle3.x_elem,angle3.y_elem,angle4.x_elem,angle4.y_elem);

    return 0;
}