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 Pascal (FPC 2.6.2) (judge verdict: Accepted)

uses
	SysUtils,
	Classes;

procedure MainProc;
	var
		text : string;
		strlist : TStringList;
		x1, y1 : Integer;
		x2, y2 : Integer;
		x3, y3: Integer;
		x4, y4: Integer;
		edgeLenX: Integer;
		edgeLenY: Integer;
	begin
	ReadLn(text);
	strlist := TStringList.Create;
	try
		strlist.Delimiter := ' ';
		strlist.DelimitedText := text;
		x1 := StrToInt(strlist.Strings[0]);
		y1 := StrToInt(strlist.Strings[1]);
		x2 := StrToInt(strlist.Strings[2]);
		y2:= StrToInt(strlist.Strings[3]);
	finally
			FreeAndNil(strlist);
			end;
	edgeLenX := x1 - x2;
	edgeLenY := y1 - y2;
	
	x3 := x2 + edgeLenY;
	y3 := y2 - edgeLenX;
	x4 := x1 + edgeLenY;
	y4 := y1 - edgeLenX;
	text := IntTostr(x3) + ' ' + IntTostr(y3) + ' ' + IntTostr(x4) + ' ' + IntTostr(y4);
	WriteLn(text);
	end;

begin
MainProc;
end.