Windows#2309
Some rectangular windows are placed on the screen, with sides parallel to the coordinate axes. Some of them may overlap. Your task is to find a point that is covered by the largest number of windows.
The first line contains the number of windows (1 \leq n \leq 50000). Each of the next lines contains the coordinates of a window: x_{1,i}, y_{1,i}, x_{2,i}, y_{2,i}, where (x_{1,i},\ y_{1,i}) are the coordinates of the upper left corner of the -th window, and (x_{2,i},\ y_{2,i}) are the coordinates of the lower right corner. On the computer screen, increases from top to bottom, and increases from left to right. All coordinates are integers and their absolute values do not exceed 2 \cdot 10^5.
Print the maximum number of windows covering any point in this configuration on the first line. On the second line, print two integers separated by a space — the coordinates of a point covered by the maximum number of windows. Windows are considered closed, that is, they also cover their boundary points.
Example 1