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
   Graku */
#include <stdio.h>

typedef struct point {
    int x;
    int y;
} point;

point shift_point(point p, int x, int y) {
    point new_p;
    new_p.x = p.x + x;
    new_p.y = p.y + y;
    return new_p;
}

int main(void){
    point p1, p2, p3, p4;
    scanf("%d %d %d %d", &p1.x, &p1.y, &p2.x, &p2.y); //input
    
    /*
    v:p1p2 vector = {p2.x-p1.x, p2.y-p1.y},
    p2p3 vector
    = {{cos(PI/2),-sin(pi/2)}, {sin(PI/2),cos(PI/2)}} x v
    = {{0, -1}, {1, 0}} x {p2.x-p1.x, p2.y-p1.y}
    = {-(p2.y-p1.y), p2.x-p1.x}
    */
    p3 = shift_point(p2, -(p2.y-p1.y), p2.x-p1.x);
    p4 = shift_point(p1, -(p2.y-p1.y), p2.x-p1.x);

    printf("%d %d %d %d", p3.x, p3.y, p4.x, p4.y); //output

    return 0;
}