The input contains several test cases. For each test case, the first line contains a single integer N (0 < N <= 50000), representing the total number of posters. Each of the following N lines contains 8 integers x1, y1, x2, y2, x3, y3, x4, y4, showing details about one poster. (x1, y1) is the coordinates of the poster's bottom-left corner, and (x2, y2) is the coordinates of the poster's top-right corner. (x3, y3) is the coordinates of the hole's bottom-left corner, while (x4, y4) is the coordinates of the hole's top-right corner. It is guaranteed that 0 <= xi, yi <= 50000 (i = 1...4) and x1 <= x3 < x4 <= x2, y1 <= y3 < y4 <= y2.
The input ends with a line of single zero.