#include <bits/stdc++.h>
#define pb push_back 
#define x first 
#define y second 
#define mod 1000000007LL
using namespace std;
typedef long long ll;
typedef pair< int , int > PII;

int n, m;
ll px, py;
double x, y;
PII a[50005];
	
double dist(int x, int y, int xx, int yy){
	return sqrt(1LL * (xx - x) * (xx - x) + 1LL * (yy - y) * (yy - y));
}

double check(int x, int y){
	double rs = 0;
	for (int i = 1; i <= n; i++)
		rs += dist(x, y, a[i].x, a[i].y);
	return rs;
}	
	
int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    freopen("adapost2.in", "r", stdin);
    freopen("adapost2.out", "w", stdout);
	scanf("%d", &n);
	for (int i = 1; i <= n; i++){
		scanf("%lf%lf", &x, &y);
		a[i] = {x * 1000, y * 1000};
		px += a[i].x;
		py += a[i].y;
	}
	px /= n; py /= n; //stabilesc o pozitie de start optima
	double CURR = check(px, py);
	double pas = 1000;
	while (pas >= 1){
		double R = check(px + pas, py);
		double L = check(px - pas, py);
		double U = check(px, py + pas);
		double D = check(px, py - pas);
		if (min({R, L, U, D}) >= CURR){pas *= 0.5; continue;}
		double mn = min({R, L, U, D});
		px += (R == mn ? pas : (L == mn ? -pas : 0));
		py += (U == mn ? pas : (D == mn ? -pas : 0));
		CURR = mn;
	}
	double rsx = px / 1000.0, rsy = py / 1000.0;
	printf("%lf %lf", rsx, rsy);
}