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

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

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

int main(void){
    point pt1,pt2,pt3,pt4;//四点の構造体を定義
    int x_diff,y_diff;//pt2とpt1の差の成分を格納する変数
    scanf("%d %d %d %d",&pt1.x_elem,&pt1.y_elem,&pt2.x_elem,&pt2.y_elem);//入力を受け取る
    
    x_diff=pt2.x_elem-pt1.x_elem;//pt2とpt1のx成分の差分
    y_diff=pt2.y_elem-pt1.y_elem;//pt2とpt1のy成分の差分
    
    //pt3の座標=pt2の座標+pt2とpt1の差分のベクトルを90度回転させたもの
    pt3.x_elem=pt2.x_elem-y_diff;
    pt3.y_elem=pt2.y_elem+x_diff;

    //pt4の座標=pt3の座標-pt2とpt1の差分
    pt4.x_elem=pt3.x_elem-x_diff;
    pt4.y_elem=pt3.y_elem-y_diff;

    printf("%d %d %d %d\n", pt3.x_elem,pt3.y_elem,pt4.x_elem,pt4.y_elem);//それぞれの値を出力
    return 0;
}