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>
//package com.company;

import java.io.*;
import java.math.BigInteger;
import java.util.*;

public class Main {
    static long TIME_START, TIME_END;
    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);
//        Scanner sc = new Scanner(new FileInputStream("Test.in"));
        PrintWriter pw = new PrintWriter(System.out);
//        PrintWriter pw = new PrintWriter(new FileOutputStream("Test.out"));
//        PrintWriter pw = new PrintWriter(new FileOutputStream("Test.in"));

        Runtime runtime = Runtime.getRuntime();
        long usedMemoryBefore = runtime.totalMemory() - runtime.freeMemory();
        TIME_START = System.currentTimeMillis();
        Task t = new Task();
        t.solve(sc, pw);
        TIME_END = System.currentTimeMillis();
        long usedMemoryAfter = runtime.totalMemory() - runtime.freeMemory();
        pw.close();
//        System.out.println("Memory increased:" + (usedMemoryAfter-usedMemoryBefore) / 1000000 );
//        System.out.println("Time used: " + (TIME_END - TIME_START) + ".");

    }

    public static class Task {

        public class Point{
            long x, y;

            public Point(long x, long y) {
                this.x = x;
                this.y = y;
            }
            public boolean onLine(Line l) {
                return (x - l.p1.x) * (l.p2.y - l.p1.y) == (y - l.p1.y) * (l.p2.x - l.p1.x);
            }
        }

        public class Line {
            Point p1, p2;

            public Line(Point p1, Point p2) {
                this.p1 = p1;
                this.p2 = p2;
            }
        }

        public void solve(Scanner sc, PrintWriter pw) throws IOException {
            int n = sc.nextInt();
            Point[] p = new Point[n];
            for (int i = 0; i < n; i++) {
                p[i] = new Point(sc.nextInt(), sc.nextInt());
            }
            if (n <= 2){
                pw.println("YES");
                return;
            }
            for (int i = 0; i < Math.min(10, n - 2); i++) {
                if (check(p, new Line(p[i], p[i + 1]), n) ) {
                    pw.println("YES");
                    return;
                }
                if (check(p, new Line(p[i], p[i + 2]), n) ) {
                    pw.println("YES");
                    return;
                }
            }
            pw.println("NO");
        }


        public boolean check(Point[] p, Line l, int n){
            boolean[] used = new boolean[n];
            Point[] other = new Point[2];
            int idx = 0;
            for (int i = 0; i < n; i++) {
                if (p[i].onLine(l)) {
                    used[i] = true;
                } else {
                    if (idx < 2)
                        other[idx++] = p[i];
                }
            }
            if (idx < 2) return true;
            Line sec = new Line(other[0], other[1]);
            for (int i = 0; i < n; i++) {
                if (p[i].onLine(sec)) {
                    used[i] = true;
                } else {
                    if (!used[i]) return false;
                }
            }
            return true;
        }


    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream s){  br = new BufferedReader(new InputStreamReader(s));}

        public Scanner(FileReader s) throws FileNotFoundException {br = new BufferedReader(s);}

        public String next() throws IOException
        {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

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

        public long nextLong() throws IOException {return Long.parseLong(next());}

        public String nextLine() throws IOException {return br.readLine();}

        public double nextDouble() throws IOException { return Double.parseDouble(next()); }

        public boolean ready() throws IOException {return br.ready();}
    }
}
