Windows (Easy)
On the screen, there are rectangular windows that may overlap, with their sides parallel to the coordinate axes. Your task is to identify the point that is covered by the greatest number of these windows.
Input
The first line of the input file specifies the number of windows, n (1 ≤ n ≤ 100). The following n lines provide the coordinates for each window: x_{(1,i)}, y_{(1,i)}, x_{(2,i)}, y_{(2,i)}. Here, (x_{(1,i)}, y_{(1,i)}) are the coordinates of the top-left corner of the i-th window, and (x_{(2,i)}, y_{(2,i)}) are the coordinates of the bottom-right corner. Note that on a computer screen, the y coordinate increases from top to bottom, and the x coordinate increases from left to right. All coordinates are integers with absolute values not exceeding 2 · 10^5.
Output
The first line of the output file should display the maximum number of windows that cover any single point in the configuration. The second line should contain two integers, separated by a space, representing the coordinates of the point that is covered by the maximum number of windows. The windows are considered closed, meaning they include their boundary points.