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?

Input

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 xi and yi (|xi|, |yi| ≤ 109)— coordinates of i-th point. All n points are distinct.

Output

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.

Examples

Input

5
0 0
0 1
1 1
1 -1
2 2


Output

YES


Input

5
0 0
1 0
2 1
1 1
2 3


Output

NO

Note

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.

<image>
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Iterator;
import java.util.StringTokenizer;
import java.util.Set;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskD solver = new TaskD();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskD {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            if (n <= 4) out.println("YES");
            else {
                point[] points = new point[n];
                for (int i = 0; i < n; i++) {
                    points[i] = new point(in.nextInt(), in.nextInt());
                }
                Set<Integer> l1 = new HashSet<>();
                Set<Integer> nl1 = new HashSet<>();
                Set<Integer> l2 = new HashSet<>();
                Set<Integer> nl2 = new HashSet<>();
                Set<Integer> l3 = new HashSet<>();
                Set<Integer> nl3 = new HashSet<>();
                for (int i = 0; i < n; i++) {
                    if (isLine(points, 0, 1, i)) {
                        l1.add(i);
                    } else nl1.add(i);
                    if (isLine(points, 1, 2, i)) {
                        l2.add(i);
                    } else nl2.add(i);
                    if (isLine(points, 2, 0, i)) {
                        l3.add(i);
                    } else nl3.add(i);
                }
                if (isLine(points, nl1) || isLine(points, nl2) || isLine(points, nl3)) {
                    out.println("YES");
                } else out.println("NO");
            }
        }

        boolean isLine(point[] points, Set<Integer> line) {
            if (line.size() <= 2) return true;
            Iterator<Integer> it = line.iterator();
            point point1 = points[it.next()];
            point point2 = points[it.next()];
            while (it.hasNext()) {
                int i = it.next();
                if ((long) (point2.x - point1.x) * (long) (points[i].y - point1.y) != (long) (point2.y - point1.y) * (long) (points[i].x - point1.x)) {
                    return false;
                }
            }
            return true;
        }

        boolean isLine(point[] points, int f, int s, int t) {
            return (long) (points[f].x - points[s].x) * (long) (points[t].y - points[s].y) == (long) (points[f].y - points[s].y) * (long) (points[t].x - points[s].x);
        }

        class point {
            int x;
            int y;

            point(int x1, int y1) {
                x = x1;
                y = y1;
            }

        }

    }

    static class InputReader {
        private StringTokenizer tokenizer;
        private BufferedReader reader;

        public InputReader(InputStream inputStream) {
            reader = new BufferedReader(new InputStreamReader(inputStream));
        }

        private void fillTokenizer() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (Exception e) {
                    throw new RuntimeException(e);
                }
            }
        }

        public String next() {
            fillTokenizer();
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}

