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)

/*  ex7_1
    kento_titech*/
#include<stdio.h>
typedef struct point{//複素数を構造体を使って定義
    int x_elem;//実部
    int y_elem;//虚部
}point;

point shift_point(point vec2,point vec1){//vec2-vec1を90°回転させた複素数にvec2を足したものを返す関数
    point vec3;
    vec3.x_elem=(vec1.y_elem-vec2.y_elem)+vec2.x_elem;//(vec2-vec1)*i+vec2の計算
    vec3.y_elem=(-vec1.x_elem+vec2.y_elem)+vec2.x_elem;
    return vec3;
}

int main(void){
    point z1,z2,z3,z4;
    scanf("%d %d %d %d",&z1.x_elem,&z1.y_elem,&z2.x_elem,&z2.y_elem);
    z3=shift_point(z2,z1);//(z2-z1)*i+z2
    z4=shift_point(z3,z2);//(z3-z2)*i+z3
    printf("%d %d %d %d\n",z3.x_elem,z3.y_elem,z4.x_elem,z4.y_elem);
    return 0;
}