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 Python (3.4.3) (judge verdict: Accepted)

import numpy as np

def get_rotation_matrix(rad):
    rot = np.array([[np.cos(rad), -np.sin(rad)],
                  [np.sin(rad), np.cos(rad)]])
    return rot

x1,y1,x2,y2= map(int,input().split())

vec1=np.array([x1,y1])
vec2=np.array([x2,y2])

vec2to1=vec1-vec2
vec2to3=np.dot(get_rotation_matrix(np.pi*3/2),vec2to1)

vec1to2=vec2-vec1
vec1to4=np.dot(get_rotation_matrix(np.pi/2),vec1to2)

vec3=vec2+vec2to3
vec4=vec1+vec1to4

print(
  int(round(vec3[0],0)),
  int(round(vec3[1],0)),
  int(round(vec4[0],0)),
  int(round(vec4[1],0)))