Tangram

Time Limit : 8 sec, Memory Limit : 65536 KB

Problem J: Tangram

Chen, your pretty sister, got absorbed in a tiling puzzle called the tangram. Suddenly, she rushed to you and asked for your help, saying "Please, please help me solve this problem! I've been stuck on this for an hour, but I can't figure out how to solve it!" Your pretty, cute, lovely sister is asking for your help, so you have to resolve the problem for her immediately, but... can you really do that?

The tangram is a puzzle considered to be rooted in China. It involves seven pieces, each of which has its specific shape. The objective of this puzzle is to form a given shape using all seven pieces. Each piece can be placed anywhere, and rotated and flipped in any way, but cannot overlap with another one.

The seven pieces consist of the following (see figure):

  • Two small right triangles (the lengths of the edges are 25√2, 25√2 and 50),
  • One medium right triangle (the lengths of the edges are 50, 50 and 50√2),
  • Two big right triangles (the lengths of the edges are 50√2, 50√ 2 and 100),
  • One square (the length of the side is 25√2), and
  • One parallelogram (the lengths of the sides are 25√2 and 50).

Given the shape of a polygon P, your program should determine whether the shape can be made by the seven pieces. To make the problem simpler, you may assume the following:

  • Each edge of P is parallel to one of the x-axis, the y-axis, y = x or y = -x.
  • P is connected, and has no hole in it. Furthermore, P is a simple polygon, i.e. it has neither self-crossing edges nor self-touching edges.

Input

The input begins with a line that contains a single integer N (3 ≤ N ≤ 30), which indicates the number of the vertices in P. The next N lines denote the coordinates of the vertices of P in clockwise order. Each line contains exactly four non-negative integers a, b, c and d, separated by a space. It represents that the corresponding vertex is at (a + b√2, c + d√2). No coordinate exceeds 1000.

Output

Print "Yes" in a line if the given shape is solvable, or "No" otherwise.

Sample Input and Output

Input #1

4
0 0 0 0
0 0 100 0
100 0 100 0
100 0 0 0

Output #1

Yes

Input #2

4
0 50 0 0
0 0 0 50
0 50 0 100
0 100 0 50

Output #2

Yes

Source: ACM-ICPC Japan Alumni Group Winter Camp , Day 3, Tokyo, Japan, 2009-02-23
http://acm-icpc.aitea.net/