/*
 * Author       : YangDavid
 * Created Time : 2020年04月23日 星期四 01时10分33秒
 */

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= n; ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

double sqr(double d) { return d * d; }
double d(double a[2], double b[2]) { return sqrt(sqr(a[0] - b[0]) + sqr(a[1] - b[1])); }
double p[3][2], o[2];
int main() {
    scanf("%lf%lf%lf%lf%lf%lf", &p[0][0], &p[0][1], &p[1][0], &p[1][1], &p[2][0], &p[2][1]);
    pii cp;
    double cans = 1e9;
    for (int x = -1000; x <= 1000; ++x)
        for (int y = -1000; y <= 1000; ++y) {
            o[0] = x, o[1] = y;
            double k = 3 * d(o, p[0]) + 2 * d(o, p[1]) + d(o, p[2]);
            if (cans > k)
                cp = pii(x, y), cans = k;
        }
    printf("%d %d\n", cp.first, cp.second);

    return 0;
}