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

#include <stdio.h>

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

point new_point(int x_elem,int y_elem){
    point new_p={x_elem,y_elem};
    return new_p;
}

point shift_point(point old,int shift_x,int shift_y){
    return new_point(old.x_elem+shift_x,old.y_elem+shift_y);
}

point add_as_complex(point point1,point point2){
    return shift_point(point1,point2.x_elem,point2.y_elem);
}

point mult_by_int_as_complex(point old,int times){
    return new_point(old.x_elem*times,old.y_elem*times);
}

point mult_as_complex(point point1,point point2){
    return new_point(point1.x_elem*point2.x_elem-point1.y_elem*point2.y_elem, point1.x_elem*point2.y_elem+point1.y_elem*point2.x_elem);
}

int main(void){
    int read1,read2;
    point vertex1,vertex2,vertex3,vertex4;
    point vector_1to2;
    point vector_2to3;
    scanf("%d",&read1);
    scanf("%d",&read2);
    vertex1=new_point(read1,read2);
    scanf("%d",&read1);
    scanf("%d",&read2);
    vertex2=new_point(read1,read2);
    vector_1to2=add_as_complex(vertex2,mult_by_int_as_complex(vertex1,-1));
    vector_2to3=mult_as_complex(vector_1to2,new_point(0,1));
    vertex3=add_as_complex(vertex2,vector_2to3);
    vertex4=add_as_complex(vertex1,vector_2to3);
    printf("%d %d %d %d\n",vertex3.x_elem,vertex3.y_elem,vertex4.x_elem,vertex4.y_elem);
    return 0;
}