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)

#include<stdio.h>

typedef struct point {
    int x_elm;
    int y_elm;
} point;

point shift_point(point, int, int);

int main() {
    int x1, y1, x2, y2;
    point p1, p2;
    point p3, p4;

    scanf("%d%d%d%d", &x1, &y1, &x2, &y2);

    p1.x_elm = x1;
    p1.y_elm = y1;
    p2.x_elm = x2;
    p2.y_elm = y2;
    
    p3 = shift_point(p2, y1 - y2, x2 - x1);
    p4 = shift_point(p1, y1 - y2, x2 - x1);

    printf("%d %d %d %d\n", p3.x_elm, p3.y_elm, p4.x_elm, p4.y_elm);

    return 0;
}

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