//Problem F: igor's solution
#include <stdio.h>
#include <iostream>
#include <map>
using namespace std;

typedef pair< long long, long long > P;
#define x first
#define y second

#define SQR(a) ((a)*(a))

int main()
{
    P t[3];
    while( 1 )
    {
        // read points
        for( int i = 0; i < 3; i++ ) if( !( cin >> t[i].x >> t[i].y ) ) return 0;

        // find the length of the longest edge
        long long maxl = 0;
        for( int i = 2, j = 0; j < 3; i = j++ )
            maxl >?= SQR( t[i].x - t[j].x ) + SQR( t[i].y - t[j].y );

        // find the answer
        bool got1 = false;
        P ans;
        for( int i = 2, j = 0; j < 3; i = j++ )
        {
            if( SQR( t[i].x - t[j].x ) + SQR( t[i].y - t[j].y ) == maxl )
            {
                P mid( ( t[i].x + t[j].x ) / 2, ( t[i].y + t[j].y ) / 2 );
                if( !got1 || mid < ans ) ans = mid;
                got1 = true;
            }
        }
        //assert( got1 );
        cout << ans.x << " " << ans.y << endl;
    }
    return 0;
}