Windows
Some rectangular windows are located on the screen with sides parallel to the coordinate axes. Some of them may overlap. You must find a point that is covered by the largest number of them.
Input
The first line contains the number of windows n (1 ≤ n ≤ 50000). Next n lines contain the windows 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 left upper corner of the i-th window, and (x[2,i], y[2,i]) are the coordinates of the right lower corner (on the screen y goes from top to bottom, and x from left tot right). All coordinates are integer, not greater than 2 · 10^5 by absolute value.
Output
In the first line print the maximum number of windows that covers some point in this configuration. The second line should contain two integers - the coordinates of any point covered by the maximum number of windows. Windows are considered closed, they cover its boundary points.