You are given $*n*$ rectangles. The corners of rectangles have integer coordinates and their edges are parallel to the $*Ox*$ and $*Oy*$ axes. The rectangles may touch each other, but they do not overlap (that is, there are no points that belong to the interior of more than one rectangle).
Your task is to determine if the rectangles form a square. In other words, determine if the set of points inside or on the border of at least one rectangle is precisely equal to the set of points inside or on the border of some square.
Input
The first line contains a single integer $*n*$ ($1 ≤ *n* ≤ 5$). Next $*n*$ lines contain four integers each, describing a single rectangle: $*x*_{1}$, $*y*_{1}$, $*x*_{2}$, $*y*_{2}$ ($0 ≤ *x*_{1} < *x*_{2} ≤ 31400, 0 ≤ *y*_{1} < *y*_{2} ≤ 31400$) — $*x*_{1}$ and $*x*_{2}$ are $*x*$-coordinates of the left and right edges of the rectangle, and $*y*_{1}$ and $*y*_{2}$ are $*y*$-coordinates of the bottom and top edges of the rectangle.
No two rectangles overlap (that is, there are no points that belong to the interior of more than one rectangle).
Output
In a single line print "YES", if the given rectangles form a square, or "NO" otherwise.
样例
5
0 0 2 3
0 3 3 5
2 0 5 2
3 2 5 5
2 2 3 3
YES
4
0 0 2 3
0 3 3 5
2 0 5 2
3 2 5 5
NO
题面与样例版权归 Codeforces 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。