//No.55 正方形を描くだけの簡単なお仕事です。

import java.util.*;
import java.io.*;
import static java.util.Arrays.*;
import static java.lang.Math.*;

public class No55 {
    
    static final Scanner in = new Scanner(System.in);
    static final PrintWriter out = new PrintWriter(System.out,false);

    static void solve() {
        int[] x = new int[3];
        int[] y = new int[3];
        for (int i=0; i<3; i++) {
            x[i] = in.nextInt();
            y[i] = in.nextInt();
        }
        int[] tx = new int[4];
        int[] ty = new int[4];
        int[] d = {0,1,2};
        do {
            for (int i=0; i<3; i++) {
                tx[i] = x[d[i]];
                ty[i] = y[d[i]];
            }
            int dx = tx[1] - tx[0];
            int dy = ty[1] - ty[0];
            if (tx[1] - dy != tx[2] || ty[1] + dx != ty[2]) continue;
            tx[3] = tx[2] - dx;
            ty[3] = ty[2] - dy;
            if (tx[3] + dy != tx[0] || ty[3] - dx != ty[0]) continue;
            out.println(tx[3]+" "+ty[3]);
            return;

        }while(nextPermutation(d));
        out.println("-1");
    }

    static boolean nextPermutation(int[] a) {
        int n = a.length, i, j;
        for (i=n-2; i>=0 && a[i]>=a[i+1]; i--);
        if (i == -1) return false;
        for (j=i+1; j<n && a[i]<a[j]; j++);
        int temp = a[i]; a[i] = a[j-1]; a[j-1] = temp;
        for (int l=i+1, r=n-1; l<r; l++,r--) {
            temp = a[l]; a[l] = a[r]; a[r] = temp;
        }
        return true;
    }

    public static void main(String[] args) {
        long start = System.currentTimeMillis();

        solve();
        out.flush();

        long end = System.currentTimeMillis();
        //trace(end-start + "ms");
        in.close();
        out.close();
    }

    static void trace(Object... o) { System.out.println(deepToString(o));}
}