// Arup Guha
// 3/5/2022
// Solution to 2021 SER D1 Problem: Dorm Room Divide

import java.util.*;
import java.io.*;

public class dormroom {

	public static int n;
	public static long[] x;
	public static long[] y;

	public static void main(String[] args) throws Exception {

		// Get # of cases.
		BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
		n = Integer.parseInt(stdin.readLine());
		
		// Read in points.
		x = new long[n];
		y = new long[n];
		for (int i=0; i<n; i++) {
			StringTokenizer tok = new StringTokenizer(stdin.readLine());
			x[i] = Long.parseLong(tok.nextToken());
			y[i] = Long.parseLong(tok.nextToken());
		}
		
		// This is the whole total area (times 4).
		long total = fourArea();
		
		long cur = 0;
		int stopIdx = -1;
		long prev = 0, stop = 0;
		
		// Go through adding triangle areas.
		for (int i=0; i<n; i++) {
			
			// Next item to add in.
			cur += (x[i]*y[(i+1)%n]-x[(i+1)%n]*y[i]);
		
			// If we were to stop here, this would be twice the area.
			stop = Math.abs(cur + (x[(i+1)%n]*y[0]-x[0]*y[(i+1)%n]));
			
			// This means we are more than halfway.
			if (4*stop > total) {
				stopIdx = i;
				break;
			}
			
			// Safe to store this.
			else
				prev = stop;
		}
		
		// What fraction of area (need/wholeT) of the next triangle I need.
		long need = total/2 - 2*prev;
		long wholeT = 2*stop - 2*prev;
		
		// Note: xDen is wholeT and yDen is wholeT		
		double myx = x[stopIdx] + 1.0*need/wholeT*(x[stopIdx+1]-x[stopIdx]);
		double myy = y[stopIdx] + 1.0*need/wholeT*(y[stopIdx+1]-y[stopIdx]);
		System.out.println(myx+" "+myy);
	}
	
	// Returns twice the area of the whole polygon.
	public static long fourArea() {
		long res = 0;
		for (int i=0; i<n; i++)
			res += (x[i]*y[(i+1)%n]-x[(i+1)%n]*y[i]);
		return Math.abs(2*res);
	}
}