#include <bits/stdc++.h>
using namespace std;
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
int g[110][110];
bool used[110];
int n;
bool is_path(int s, int t, int c) {
  if (s == t) return true;
  used[s] = 1;
  for (int i = (0); i < (n); i++) {
    if (g[s][i] >= c && !used[i] && is_path(i, t, c)) {
      g[s][i] -= c;
      g[i][s] += c;
      return true;
    }
  }
  return false;
}
void swap(int &a, int &b) {
  int t = a;
  a = b;
  b = a;
}
int main() {
  int x[2], y[2];
  int i;
  for (int i = (0); i < (2); i++) {
    scanf("%d", &x[i]);
    scanf("%d", &y[i]);
  }
  if (x[0] == x[1] && y[0] == y[1]) {
    printf("-1\n");
    return 0;
  }
  if (x[0] == x[1]) {
    int diff = abs(y[0] - y[1]);
    printf("%d %d %d %d\n", x[0] + diff, y[0], x[0] + diff, y[1]);
  } else if (y[0] == y[1]) {
    int diff = abs(x[0] - x[1]);
    printf("%d %d %d %d\n", x[0], y[0] + diff, x[1], y[1] + diff);
  } else {
    if (abs(x[0] - x[1]) == abs(y[0] - y[1])) {
      printf("%d %d %d %d\n", x[0], y[1], x[1], y[0]);
    } else {
      printf("-1\n");
    }
  }
}
