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.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
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);
        ProblemDPairOfLines solver = new ProblemDPairOfLines();
        solver.solve(1, in, out);
        out.close();
    }

    static class ProblemDPairOfLines {
        int gcd(int a, int b) {
            return b == 0 ? a : gcd(b, a % b);
        }

        boolean equal(int a1, int a2, int b1, int b2) {
            if (a1 == a2 && b1 == b2) return true;
            return a1 == -a2 && b1 == -b2;
        }

        boolean equalSlopes(Point a, Point b, Point c) {
            int dx1 = a.x - b.x;
            int dy1 = a.y - b.y;
            int gcd1 = gcd(Math.abs(dx1), Math.abs(dy1));
            dx1 /= gcd1;
            dy1 /= gcd1;
            int dx2 = a.x - c.x;
            int dy2 = a.y - c.y;
            int gcd2 = gcd(Math.abs(dx2), Math.abs(dy2));
            dx2 /= gcd2;
            dy2 /= gcd2;
            return equal(dx1, dx2, dy1, dy2);
        }

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            if (n <= 4) {
                out.println("YES");
                return;
            }
            Point[] pts = new Point[n];
            for (int i = 0; i < n; ++i) {
                pts[i] = new Point(in.nextInt(), in.nextInt(), i);
            }

            Point[] line = {pts[0], pts[1]};
            ArrayList<Point> notCovered = new ArrayList<>();
            for (int i = 2; i < n; ++i) {
                if (!equalSlopes(line[0], line[1], pts[i])) {
                    notCovered.add(pts[i]);
                }
            }
            boolean online = true;
            for (int i = 2; i < notCovered.size(); ++i) {
                if (!equalSlopes(notCovered.get(0), notCovered.get(1), notCovered.get(i))) {
                    online = false;
                    break;
                }
            }
            if (online) {
                out.println("YES");
                return;
            }
            line = new Point[]{pts[0], pts[2]};
            notCovered = new ArrayList<>();
            for (int i = 0; i < n; ++i) {
                if (i == 0 || i == 2) continue;
                if (!equalSlopes(line[0], line[1], pts[i])) {
                    notCovered.add(pts[i]);
                }
            }
            online = true;
            for (int i = 2; i < notCovered.size(); ++i) {
                if (!equalSlopes(notCovered.get(0), notCovered.get(1), notCovered.get(i))) {
                    online = false;
                    break;
                }
            }
            if (online) {
                out.println("YES");
                return;
            }
            line = new Point[]{pts[1], pts[2]};
            notCovered = new ArrayList<>();
            for (int i = 0; i < n; ++i) {
                if (i == 1 || i == 2) continue;
                if (!equalSlopes(line[0], line[1], pts[i])) {
                    notCovered.add(pts[i]);
                }
            }
            online = true;
            for (int i = 2; i < notCovered.size(); ++i) {
                if (!equalSlopes(notCovered.get(0), notCovered.get(1), notCovered.get(i))) {
                    online = false;
                    break;
                }
            }
            if (online) {
                out.println("YES");
                return;
            }
            out.println("NO");
        }

        class Point {
            int x;
            int y;
            int id;

            Point(int xx, int yy, int i) {
                x = xx;
                y = yy;
                id = i;
            }

            public int hashCode() {
                return 3274923 * x + 23457283 * y;
            }

            public boolean equals(Object o) {
                Point p = (Point) o;
                return p.x == x && p.y == y;
            }

            public String toString() {
                return String.format("(%d, %d)", x, y);
            }

        }

    }

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

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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

    }
}

