CF166B Polygons

Description

You've got another geometrical task. You are given two non-degenerate polygons $ A $ and $ B $ as vertex coordinates. Polygon $ A $ is strictly convex. Polygon $ B $ is an arbitrary polygon without any self-intersections and self-touches. The vertices of both polygons are given in the clockwise order. For each polygon no three consecutively following vertices are located on the same straight line. Your task is to check whether polygon $ B $ is positioned strictly inside polygon $ A $ . It means that any point of polygon $ B $ should be strictly inside polygon $ A $ . "Strictly" means that the vertex of polygon $ B $ cannot lie on the side of the polygon $ A $ .

Input Format

The first line contains the only integer $ n $ ( $ 3

Output Format

Print on the only line the answer to the problem — if polygon $ B $ is strictly inside polygon $ A $ , print "YES", otherwise print "NO" (without the quotes).