Pashmak has fallen in love with an attractive girl called Parmida since one year ago...

Today, Pashmak set up a meeting with his partner in a romantic garden. Unfortunately, Pashmak has forgotten where the garden is. But he remembers that the garden looks like a square with sides parallel to the coordinate axes. He also remembers that there is exactly one tree on each vertex of the square. Now, Pashmak knows the position of only two of the trees. Help him to find the position of two remaining ones.

Input

The first line contains four space-separated x1, y1, x2, y2 ( - 100 ≤ x1, y1, x2, y2 ≤ 100) integers, where x1 and y1 are coordinates of the first tree and x2 and y2 are coordinates of the second tree. It's guaranteed that the given points are distinct.

Output

If there is no solution to the problem, print -1. Otherwise print four space-separated integers x3, y3, x4, y4 that correspond to the coordinates of the two other trees. If there are several solutions you can output any of them. 

Note that x3, y3, x4, y4 must be in the range ( - 1000 ≤ x3, y3, x4, y4 ≤ 1000).

Examples

Input

0 0 0 1


Output

1 0 1 1


Input

0 0 1 1


Output

0 1 1 0


Input

0 0 1 2


Output

-1
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.*;

public class Round260 {

    public static void main(String[] args) {

        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(in, out);
        out.close();
    }
}

/*
 * Am I wrong for thinking out the box from where I stay? Am I wrong for saying
 * that I choose another way?
 * 
 * I ain't trying to do what everybody else doing Just cause everybody doing
 * what they all do
 * 
 * If one thing I know, I'll fall but I'll grow
 * 
 * I'm walking down this road of mine, this road that I call home
 * 
 * So am I wrong?
 */

class TaskC {

    public void solve(InputReader in, PrintWriter out) {
        int x = in.nextInt();
        int y = in.nextInt();
        int x1 = in.nextInt();
        int y1 = in.nextInt();

        if (x == x1) {
            out.println((x + Math.abs(y - y1)) + " " + y + " "
                    + (x1 + Math.abs(y - y1)) + " " + y1);
            return;
        }
        if (y == y1) {
            out.println(x + " " + (y + Math.abs(x - x1)) + " " + x1 + " "
                    + (y1 + Math.abs(x - x1)));
            return;
        }
        if (Math.abs(x - x1) == Math.abs(y - y1)) {
            out.println(x + " " + y1 + " " + x1 + " " + y);
            return;
        }
        out.println(-1);
        return;
    }
}

/*
 * For thinking that we could be something for real? Now am I wrong?
 * 
 * For trying to reach the things that I can't see?
 * 
 * But that's just how I feel,
 * 
 * That's just how I feel
 * 
 * That's just how I feel
 * 
 * Trying to reach the things that I can't see
 */

class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream), 32768);
        tokenizer = null;
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }
}
