Determine whether a given polygon is convex.
The first line of one number - N (3 ≤ N ≤ 100000). Next N lines in a pair of numbers - the coordinates of another vertex simple polygon in order to circumvent or counterclockwise. All coordinates are integers modulo not exceeding 10000.
One line of "YES", if given polygon is convex, and "NO" otherwise.