ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules

USU Internal Contest March'2002

About     Problems     Submit solution     Judge status     Standings
Contest is over

H. Median on the Plane

Time limit: 1.0 second
Memory limit: 64 MB
The are N points on the plane (N is even). No three points belong to the same strait line. Your task is to select two points in such a way, that strait line they belong to divides the set of points into two equal-sized parts.

Input

First line contains one integer N (2 ≤ N ≤ 10000). Each of next N lines contains pair of integers xi, yi (−109xi, yi ≤ 109), the coordinates of i-th point.

Output

Print the numbers of selected points.

Sample

inputoutput
4
0 0
1 0
0 1
1 1
1 4
Problem Author: Pavel Atnashev
Problem Source: USU Internal Contest, March 2002
To submit the solution for this problem go to the Problem set: 1207. Median on the Plane