CF 261A. Pashmak and Garden

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>

#define maxn 10000+5
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657
#define INF 1<<30
const ull inf = 1LL << 61;
const double eps=1e-5;

using namespace std;

bool cmp(int a,int b){
    return a>b;
}

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int x1,x2,y1,y2;
    int x3,y3,x4,y4;
    int mark1=0,mark=0;
    cin>>x1>>y1>>x2>>y2;
    if(x1==x2)
    {
        int d=abs(y1-y2);
        x3=x1+d;
        x4=x1+d;
        if(x3>1000)
        {
            x3=x1-d;
            x4=x1-d;
            if(x3<-1000){cout<<-1<<endl;mark=1;}
        }
        if(!mark)cout<<x3<<" "<<y1<<" "<<x4<<" "<<y2<<endl;
    }
    else
    if(y1==y2)
    {
        int d=abs(x1-x2);
        y3=y1+d;
        y4=y1+d;
        if(y3>1000||y4>1000)
        {
            y3=y1-d;
            y4=y1-d;
            if(y3<-1000||y4<-10000){cout<<-1<<endl;mark1=1;}
        }
        if(!mark1)cout<<x1<<" "<<y3<<" "<<x2<<" "<<y4<<endl;
    }
    else
    {
        int d=abs(x1-x2);
        int t=abs(y1-y2);
        if(t!=d)cout<<-1<<endl;
        else
        {
            cout<<x1<<" "<<y2<<" "<<x2<<" "<<y1<<endl;
        }
    }
    return 0;
}