import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { try { for (; ; ) { auto X = new long[3]; auto Y = new long[3]; foreach (i; 0 .. 3) { X[i] = readInt(); Y[i] = readInt(); } foreach (i; 0 .. 3) { const a = X[(i + 1) % 3] - X[i]; const b = Y[(i + 1) % 3] - Y[i]; const c = X[(i + 2) % 3] - X[i]; const d = Y[(i + 2) % 3] - Y[i]; if (a * c + b * d == 0 && a^^2 + b^^2 == c^^2 + d^^2) { writeln(X[i] + a + c, " ", Y[i] + b + d); goto found; } } writeln(-1); found: } } catch (EOFException e) { } }