Windows (Easy)#2305
On the screen, there are rectangular windows, possibly overlapping, with sides parallel to the coordinate axes. Your task is to find the point that is covered by the greatest number of these windows.
The first line of the input contains the number of windows (1 \leq n \leq 100). Each of the following lines contains the coordinates x_{(1,i)}, y_{(1,i)}, x_{(2,i)}, y_{(2,i)}, where (x_{(1,i)}, y_{(1,i)}) are the coordinates of the top-left corner of the -th window, and (x_{(2,i)}, y_{(2,i)}) are the coordinates of the bottom-right corner. On a computer screen, the -coordinate increases from top to bottom, and the -coordinate increases from left to right. All coordinates are integers and their absolute values do not exceed 2 \cdot 10^5.
The first line should output the maximum number of windows covering any single point. The second line should contain two integers, separated by a space, representing the coordinates of a point covered by the maximum number of windows. Windows are closed, i.e., they include their boundary points.
Example 1