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>
int main(void){
	
	double x1,x2,y1,y2,n,d;
	double x3,x4,y3,y4;
	int s3,s4,t3,t4;
	
	scanf("%lf %lf %lf %lf",&x1,&y1,&x2,&y2);
	
	d=y1-y2;
	
	n=(y2-y1)/(x2-x1);
	
	x3=x2+d;
	
	y3=-(1/n)*x3+(y2+(x2/n));
	
	x4=x1+d;
	
	y4=-(1/n)*x4+(y1+(x1/n));

	
	
	if(x3>=0){
		s3=x3+0.0000000001;
	}else{
		s3=x3-0.000000001;
	}
	
	if(x4>=0){
		s4=x4+0.0000000001;
	}else{
		s4=x4-0.000000001;
	}
	
	if(y3>=0){
		t3=y3+0.0000000001;
	}else{
		t3=y3-0.000000001;
	}
	
	if(y4>=0){
		t4=y4+0.0000000001;
	}else{
		t4=y4-0.000000001;
	}
	
//	printf("%lf %lf %lf %lf\n",x3,y3,x4,y4);
	printf("%d %d %d %d\n",s3,t3,s4,t4);
	
	return 0;
}