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# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.IO;
using System.Linq;
using System.Collections.Generic;
using System.Text;

public class Program
{

    public void Proc()
    {

        int[] inpt = Reader.ReadLine().Split(' ').Select(a => int.Parse(a)).ToArray();

        int x1 = inpt[0];
        int y1 = inpt[1];

        int x2 = inpt[2];
        int y2 = inpt[3];


        int x3 = 0;
        int y3 = 0;
        int x4 = 0;
        int y4 = 0;

        int xKatamuki = (x1 - x2);
        int yKatamuki = (y1 - y2);

        x3 = x2 + yKatamuki;
        y3 = y2 - xKatamuki;

        x4 = x3 + xKatamuki;
        y4 = y3 + yKatamuki;


        Console.WriteLine(string.Join(" ", new int[] { x3, y3, x4, y4 }));

        if (xKatamuki == 0) {
            if(y1 < y2) {
                x3 = x2 + yKatamuki;
            }
        } else if (yKatamuki == 0) {

        } else {
            int newY1 = y2 + xKatamuki;
            int newY2 = y2 - xKatamuki;

            int newX1 = x2 + (yKatamuki * -1);
            int newX2 = x2 - (yKatamuki * -1);

            if(x1 < x2) {
                x3 = x2 + yKatamuki;
                y3 = y2 - xKatamuki;

                x4 = x3 + xKatamuki;
                y4 = y3 + yKatamuki;

            } else {
                x3 = x2 + yKatamuki;
                y3 = y2 - xKatamuki;

                x4 = x3 + xKatamuki;
                y4 = y3 + yKatamuki;
            }
        }
    }





    public class Reader
    {
        static StringReader sr;
        public static bool IsDebug = false;
        public static string ReadLine()
        {
            if (IsDebug)
            {
                if (sr == null)
                {
                    sr = new StringReader(InputText.Trim());
                }
                return sr.ReadLine();
            }
            else
            {
                return Console.ReadLine();
            }
        }
        private static string InputText = @"


0 0 0 1


";
    }

    public static void Main(string[] args)
    {
#if DEBUG
        Reader.IsDebug = true;
#endif
        Program prg = new Program();
        prg.Proc();
    }
}