Rocky Mountain

The Rocky Mountain Cable (RMC) company plans to run cables from the top peak of the Rocky Mountains down to lower points in the range. Cable cars will carry tourists to the highest peak.

Each cable must run in a straight line from one of the candidate sites to the highest peak, and it cannot cross any part of the mountain range. However, the cable may coincide with a slope.

To serve the most tourists, the cable should go from the highest peak down to the lowest possible site. Find the best site on the left of the highest peak and the best site on the right. If there is a tie, choose the leftmost site on the left and the rightmost site on the right.

The mountain range is given by $N$ sites $(x_i, y_i)$. One of these sites is the unique highest peak $(x_p, y_p)$, where $1 < p < N$ and $y_p > y_i$ for all $i \neq p$. The highest peak cannot be the first or the last site. The range is drawn by straight segments joining $(x_i, y_i)$ and $(x_{i+1}, y_{i+1})$ for $1 \leq i < N$, where $x_i < x_{i+1}$.

The first line contains an integer $N$ ($3 \leq N \leq 5 \cdot 10^5$), the number of sites. Each of the next $N$ lines contains two integers $x_i$ and $y_i$, the coordinates of a site. The coordinates satisfy $0 \leq x_i, y_i \leq 10^9$. The input guarantees a unique highest peak and $x_i < x_{i+1}$ for all $1 \leq i < N$.

On the first line, print the coordinates of the best site to the left of the highest peak. On the second line, print the coordinates of the best site to the right of the highest peak.