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 5.4.1) (judge verdict: Wrong Answer)

#include<stdio.h>
#include<math.h>

#define PI 3.14159265359

int marume(float x);

int main(void)
{
	int x[4],y[4];
	float len,rad;
	
	scanf("%d %d %d %d",&x[0],&y[0],&x[1],&y[1]);
		
	len=sqrt(pow(x[1]-x[0],2)+pow(y[1]-y[0],2));
	rad=atan2(y[1]-y[0],x[1]-x[0]);
	
	printf("len:%f\n",len);
	printf("rad:%f\n",rad);
	if(x[1]-x[0]==0){
		x[2]=x[1]-len;
		y[2]=y[1];
		x[3]=x[0]-len;
		y[3]=y[2]-len;
	} else{
		x[2]=marume((float)x[1]-len*cos(PI/2-rad));
		y[2]=marume((float)y[1]+len*sin(PI/2-rad));
		x[3]=marume((float)x[2]-len*cos(rad));
		y[3]=marume((float)y[2]-len*sin(rad));
	}
	
	printf("%d %d %d %d\n",x[2],y[2],x[3],y[3]);
	
	return 0;
}

int marume(float x)
{
	if ( x > 0.0 ) {
        	return floor(x + 0.5);
	} else {
        	return -1.0 * floor(fabs(x) + 0.5);
    	}
}