Codeforces Round #261 (Div. 2)-A. Pashmak and Garden（容易）

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 x₁, y₁, x₂, y₂( - 100 ≤ x₁, y₁, x₂, y₂ ≤ 100) integers, wherex₁ andy₁ are coordinates of the first tree andx₂ andy₂ 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 x₃, y₃, x₄, y₄ that correspond to the coordinates of the two other trees. If there are several solutions you can output any of them.

Note that x₃, y₃, x₄, y₄ must be in the range( - 1000 ≤ x₃, y₃, x₄, y₄ ≤ 1000).

Sample test(s)

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

                                                                      

注意正负即可

CODE :

#include <iostream>#include <cstdio>#include <algorithm>#include <cmath>#include <string>#include <cstring>#include <queue>#include <stack>#include <vector>#include <set>#include <map>const int inf=0xfffffff;typedef long long ll;using namespace std;int main(){    int x1,y1,x2,y2;    while(~scanf("%d%d %d%d",&x1,&y1,&x2,&y2)){        if(y1==y2){            int cnt=abs(x1-x2);            printf("%d %d %d %d\n",x1,y1+cnt,x2,y2+cnt);        }        else if(x1==x2){            int cnt=abs(y1-y2);            printf("%d %d %d %d\n",x1+cnt,y1,x2+cnt,y2);        }        else{            if(abs(x1-x2)==abs(y1-y2)){                printf("%d %d %d %d\n",x1,y2,x2,y1);            }            else printf("-1\n");        }    }    return 0;}