CF961D.Pair Of Lines

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?

给你平面上的 $ n $ 个点。每个点均为格点（即其横纵坐标均为整数），且所有点互不相同。

你可以画两条直线（这两条直线可以重合）。是否可能以某种方式画出这两条直线，使得每个点都至少位于其中一条直线上？

The first line contains one integer n (1 ≤ n ≤ 105) — 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| ≤ 109)— coordinates of i-th point. All n points are distinct.

第一行包含一个整数 $n$（$1 \leq n \leq 10^5$）—— 表示你所给定的点的数量。

接下来是 $n$ 行，每行包含两个整数 $x_i$ 和 $y_i$（$|x_i|, |y_i| \leq 10^9$），表示第 $i$ 个点的坐标。所有 $n$ 个点互不相同。

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.

如果可以画出两条直线，使得给定的所有点都至少位于其中一条直线上，则输出 YES；否则输出 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.

在第一个例子中，可以画出两条直线：一条经过点 1、3 和 5，另一条经过剩余的两个点。