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.io.OutputStream;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

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

    static class TaskD {
        Debug debug;

        public void solve(int testNumber, FastReader in, PrintWriter out) {
            debug = new Debug(out);
            int n = in.nextInt();
            long[][] p = new long[n][];
            for (int i = 0; i < n; ++i) p[i] = new long[]{in.nextInt(), in.nextInt()};
            if (n <= 2) {
                out.println("YES");
                return;
            }
            if (check(0, 1, p)) {
                out.println("YES");
                return;
            }
            if (check(0, 2, p)) {
                out.println("YES");
                return;
            }
            if (check(1, 2, p)) {
                out.println("YES");
                return;
            }
            out.println("NO");
        }

        private boolean check(int f, int s, long[][] p) {
            int n = p.length;
            long x1 = p[f][0];
            long y1 = p[f][1];
            long x2 = p[s][0];
            long y2 = p[s][1];
            long y1y2 = (y2 - y1);
            long x1x2 = (x2 - x1);
            boolean[] marked = new boolean[n];

            for (int i = 0; i < n; ++i) {
                long x = p[i][0];
                long y = p[i][1];
                long yy1 = (y - y1) * (x1x2);
                long xx1 = (x - x1) * (y1y2);
                if (xx1 == yy1) marked[i] = true;
            }
            int ind1 = -1;
            int ind2 = -1;
            for (int i = 0; i < n; ++i) {
                if (marked[i]) continue;
                if (ind1 == -1) ind1 = i;
                else if (ind2 == -1) ind2 = i;
                else break;
            }
            if (ind1 == -1 || ind2 == -1) {
                return true;
            }
            f = ind1;
            s = ind2;
            x1 = p[f][0];
            y1 = p[f][1];
            x2 = p[s][0];
            y2 = p[s][1];
            y1y2 = (y2 - y1);
            x1x2 = (x2 - x1);
            for (int i = 0; i < n; ++i) {
                if (marked[i]) continue;
                long x = p[i][0];
                long y = p[i][1];
                long yy1 = (y - y1) * (x1x2);
                long xx1 = (x - x1) * (y1y2);
                if (xx1 == yy1) marked[i] = true;
            }
            boolean flag = true;
            for (int i = 0; i < n; ++i) flag &= marked[i];
            return flag;
        }

    }

    static class Debug {
        PrintWriter out;
        boolean oj;
        boolean system;
        long timeBegin;
        Runtime runtime;

        public Debug(PrintWriter out) {
            oj = System.getProperty("ONLINE_JUDGE") != null;
            this.out = out;
            this.timeBegin = System.currentTimeMillis();
            this.runtime = Runtime.getRuntime();
        }

        public Debug() {
            system = true;
            oj = System.getProperty("ONLINE_JUDGE") != null;
            OutputStream outputStream = System.out;
            this.out = new PrintWriter(outputStream);
            this.timeBegin = System.currentTimeMillis();
            this.runtime = Runtime.getRuntime();
        }

    }

    static class FastReader {
        private InputStream stream;
        private byte[] buf = new byte[8192];
        private int curChar;
        private int pnumChars;

        public FastReader(InputStream stream) {
            this.stream = stream;
        }

        private int pread() {
            if (pnumChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= pnumChars) {
                curChar = 0;
                try {
                    pnumChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (pnumChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = pread();
            while (isSpaceChar(c))
                c = pread();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = pread();
            }
            int res = 0;
            do {
                if (c == ',') {
                    c = pread();
                }
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = pread();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        private boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

    }
}

