D. Star Trek Wall
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Rectangular Star Trek posters are hanging on Michael's wall. His goal is to one day cover the entire wall, but he's unsuccessful so far. Fortunately, he has enough pieces of tape to move one of his posters to a new location.

Given the location of his existing posters, return "Yes" if it's possible for Michael to cover the entire wall by moving one poster and "No" otherwise.

For example, his wall may look like this: 

  1 2 3 4 5
1 1 1 0 0 0 
2 1 1 0 0 0 
3 0 0 0 0 0 
4 0 0 1 1 1
5 0 0 1 1 1

with the coordinates of the posters being (1, 1) and (2, 2) for the first and (4,3) and (5,5) for the second.

Input

The first line contains a single integer $$$N$$$ $$$(1\le N\le 10)$$$ - the number of posters.

For the following $$$N$$$ lines, each line contains 4 integers $$$x_1,y_1,x_2,y_2$$$ $$$(1\le x_1,y_1,x_2,y_2\le 20)$$$ describing $$$(x_1,y_1)$$$, the upper left corner, and $$$(x_2,y_2)$$$, the lower right corner, of the $$$i$$$-th posters.

Output

Print "Yes" if it's possible for Michael to cover the entire wall by moving one poster and "No" otherwise. (without quotes)