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

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Sanket Makani
 */
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);
        ProblemDPairOfLines solver = new ProblemDPairOfLines();
        solver.solve(1, in, out);
        out.close();
    }

    static class ProblemDPairOfLines {
        public void solve(int testNumber, InputReader sc, PrintWriter w) {
            int n = sc.nextInt();

            if (n <= 2) {
                w.print("YES");
                return;
            }
            long arr[][] = new long[n][2];


            for (int i = 0; i < n; i++) {
                arr[i][0] = sc.nextLong();
                arr[i][1] = sc.nextLong();
            }

            int iter = 100;
            Random random = new Random();

            while (iter-- > 0) {
                int point1 = random.nextInt(n);
                int point2 = random.nextInt(n);

                int tries = 10000;
                while (tries-- > 0 && point1 == point2)
                    point2 = random.nextInt(n);

                long diffX = arr[point2][0] - arr[point1][0];
                long diffY = arr[point2][1] - arr[point1][1];

                long a = diffY;
                long b = -diffX;
                long c = arr[point1][1] * diffX - arr[point1][0] * diffY;

                ArrayList<Integer> list = new ArrayList<>();

                int mainFlag = 0;
                for (int i = 0; i < n; i++) {
                    long val = a * arr[i][0] + b * arr[i][1] + c;
                    if (val == 0)
                        continue;
                    list.add(i);
                }

                if (list.size() <= 1) {
                    w.println("YES");
                    return;
                }
                int index1 = list.get(0);
                int index2 = list.get(1);

                diffX = arr[index1][0] - arr[index2][0];
                diffY = arr[index1][1] - arr[index2][1];

                a = diffY;
                b = -diffX;
                c = arr[index2][1] * diffX - arr[index2][0] * diffY;
                mainFlag = 0;
                for (int in : list) {
                    long val = a * arr[in][0] + b * arr[in][1] + c;
                    if (val == 0)
                        continue;
                    mainFlag++;
                }

                if (mainFlag == 0) {
                    w.println("YES");
                    return;
                }
            }
            w.println("NO");

        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

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

        public int read() {
            if (numChars == -1)
                throw new InputMismatchException();

            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }

                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = read();

            while (isSpaceChar(c))
                c = read();

            int sgn = 1;

            if (c == '-') {
                sgn = -1;
                c = read();
            }

            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c));

            return res * sgn;
        }

        public long nextLong() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long res = 0;

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

        public boolean isSpaceChar(int c) {
            if (filter != null)
                return filter.isSpaceChar(c);
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}

