Migrated from Lutece 802 Just a Line

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

There are $N$ points on a plane, among them $N-1$ points will form a line, your task is to find the point that is not on the line.

Input

The first line contains a single number $N$, the number of points. $(4\leq N\leq 50000)$

Then come $N$ lines each with two numbers $(x_{i}, y_{i})$, giving the position of the points. The points are given in integers. No two points' positions are the same. $(-10^9\leq x_{i}, y_{i}\leq 10^9)$

Output

Output the position of the point that is not on the line.

Samples

5
0 0
1 1
3 4
2 2
4 4

3 4

Resources

the 12th UESTC Programming Contest Preliminary