#include<cstdio>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
const double eps = 1e-8;
int sgn(double x)
{if(fabs(x) < eps) return 0;else return x < 0 ? -1 : 1;
}
struct Point{double x, y;Point(){}Point(double _x, double _y){x = _x, y = _y;}bool operator == (Point b) const{return sgn(x - b.x) == 0 && sgn(y - b.y) == 0;}bool operator < (Point b)const{return sgn(x - b.x) == 0 ? sgn(y - b.y < 0) : x < b.x;}Point operator - (const Point &b)const{return Point(x - b.x, y - b.y);}//叉积double operator ^(const Point &b){return x * b.y - y * b.x;}//点积double operator *(const Point &b){return x * b.x + y * b.y;}double len(){return hypot(x, y);}double len2(){return x * x + y * y;}double distant(Point p){return hypot(x - p.x, y - p.y);}Point operator + (const Point &b)const{return Point (x + b.x, y + b.y);}Point operator * (const double &k)const{return Point(x * k, y * k);}Point operator / (const double &k)const{return Point(x / k, y / k);}
};
int main()
{double x1, x2, x3, x4, y1, y2, y3, y4;Point p[4], c;while(~scanf("%lf %lf %lf %lf %lf %lf %lf %lf",&x1, &y1, &x2, &y2, &x3, &y3, &x4, &y4)){p[0] = Point(x1,y1);p[1] = Point(x2,y2);p[2] = Point(x3,y3);p[3] = Point(x4,y4);sort(p , p + 4);if(p[0] == p[1]){c = p[2] + p[3] - p[1];}if(p[1] == p[2]){c = p[0] + p[3] - p[1];}if(p[2] == p[3]){c = p[1] + p[0] - p[3];}printf("%.3f %.3f\n",c.x, c.y);}return 0;
}