Preparing NOJ

You are given *n* points on Cartesian plane. Every point is a lattice point (i. e. both of its coordinates are integers), and all points are distinct.

You may draw two straight lines (not necessarily distinct). Is it possible to do this in such a way that every point lies on at least one of these lines?

The first line contains one integer *n* (1 ≤ *n* ≤ 10^{5}) — the number of points you are given.

Then *n* lines follow, each line containing two integers *x*_{i} and *y*_{i} (|*x*_{i}|, |*y*_{i}| ≤ 10^{9})— coordinates of *i*-th point. All *n* points are distinct.

If it is possible to draw two straight lines in such a way that each of given points belongs to at least one of these lines, print YES. Otherwise, print NO.

5

0 0

0 1

1 1

1 -1

2 2

YES

5

0 0

1 0

2 1

1 1

2 3

NO

In the first example it is possible to draw two lines, the one containing the points 1, 3 and 5, and another one containing two remaining points.

Info

Provider CodeForces

Origin Educational Codeforces Round 41 (Rated for Div. 2)

Code CF961D

Tags

geometry

Submitted 87

Passed 42

AC Rate 48.28%

Date 03/04/2019 16:22:24

Related