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.*;
import java.util.*;
public class Task{
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskE solver = new TaskE();
        solver.solve(1, in, out);
        out.flush();out.close();
    }
        static class TaskE {
        class pair{
            int F,S,T;
            pair(int a,int b){F=a;S=b;}
            pair(int a,int b,int c){F=a;S=b;T=c;}
        }
        int n;
        pair p[];
        TreeSet<pair> ts=new TreeSet<>((A,B)->A.F==B.F?A.S-B.S:A.F-B.F);
        ArrayList<Integer> al=new ArrayList<>();
        int chk(){
            int sz=al.size();int cnt=0;
            if(sz<=2)return cnt;
            pair i0=p[al.get(0)],i1=p[al.get(1)];
            for(int i=2;i<sz;i++){
                pair it=p[al.get(i)];
                if((long)(i1.S-i0.S)*(i1.F-it.F)!=(long)(i1.S-it.S)*(i1.F-i0.F))++cnt;
            }return cnt;
        }
        pair slope(int i0,int i1){
            int num=p[i0].S-p[i1].S,den=p[i0].F-p[i1].F;
            if(den<0){
                den=-den;num=-num;
            }
            if(den==0){
                num=1;
            }else if(num==0){
                den=0;
            }
            if(num==0||den==0)return new pair(num,den);
            int gcd=gcd(Math.abs(num),den);
            return new pair(num/gcd,den/gcd);
        }
        int gcd(int a,int b){
            if(b%a==0)return a;
            return gcd(b%a,a);
        }
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            n=in.nextInt();
            p=new pair[n];
            for(int i=0;i<n;i++)p[i]=new pair(in.nextInt(),in.nextInt());
            boolean is=false;
            int num=0,den=0;
            pair sl[]=new pair[n];
            for(int i=1;i<n;i++)
                sl[i]=slope(0,i);

            for(int i=1;i<n;i++){
                Object o=ts.ceiling(sl[i]);
                if(o==null){
                    ts.add(new pair(sl[i].F,sl[i].S));
                }else{
                    pair ck=(pair)o;
                    if(ck.F==sl[i].F&&ck.S==sl[i].S){
                        is=true;
                        num=ck.F;den=ck.S;
                        break;
                    }
                    ts.add(new pair(sl[i].F,sl[i].S));
                }
            }
            if(is){
                for(int i=1;i<n;i++){
                    if(sl[i].F==num&&sl[i].S==den){}
                    else al.add(i);
                }
                if(chk()>0)is=false;
            }else{
                for(int i=2;i<n;i++)al.add(i);
                if(chk()>0){
                    al.remove(0);al.add(0,1);
                    if(chk()>0){
                        al.add(0,2);
                        if(chk()<=1)is=true;
                    }else{
                        is=true;
                    }
                }else is=true;    
            }
            out.print((is?"YES":"NO"));
          }
//         pair ja[][];long w[];int from[],to[],c[];
//             void make(int n,int m,InputReader in){
//              ja=new pair[n+1][];w=new long[m];from=new int[m];to=new int[m];c=new int[n+1];
//              for(int i=0;i<m;i++){
//               int u=in.nextInt(),v=in.nextInt();long wt=in.nextLong();
//               c[u]++;c[v]++;from[i]=u;to[i]=v;w[i]=wt;
//              }
//              for(int i=1;i<=n;i++){
//               ja[i]=new pair[c[i]];c[i]=0;
//              }
//              for(int i=0;i<m;i++){
//               ja[from[i]][c[from[i]]++]=new pair(to[i],w[i]);
//               ja[to[i]][c[to[i]]++]=new pair(from[i],w[i]);
//              }
//             }
//        int[] radixSort(int[] f){ return radixSort(f, f.length); }
//    int[] radixSort(int[] f, int n)
//    {
//        int[] to = new int[n];
//        {
//            int[] b = new int[65537];
//            for(int i = 0;i < n;i++)b[1+(f[i]&0xffff)]++;
//            for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
//            for(int i = 0;i < n;i++)to[b[f[i]&0xffff]++] = f[i];
//            int[] d = f; f = to;to = d;
//        }
//        {
//            int[] b = new int[65537];
//            for(int i = 0;i < n;i++)b[1+(f[i]>>>16)]++;
//            for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
//            for(int i = 0;i < n;i++)to[b[f[i]>>>16]++] = f[i];
//            int[] d = f; f = to;to = d;
//        }
//        return f;
//    }
    }
    static class InputReader {
        BufferedReader br;
        StringTokenizer st;
        public InputReader(InputStream stream) {
            br = new BufferedReader(new InputStreamReader(stream));
            st = null;
        }

        String next() {
            while (st == null || !st.hasMoreTokens()) {
                String s = null;
                try {
                    s = br.readLine();
                } catch (IOException e) {
                    e.printStackTrace();
                }
                if (s == null)
                    return null;
                st = new StringTokenizer(s);
            }
            return st.nextToken();
        }

        boolean hasMoreTokens() {
            while (st == null || !st.hasMoreTokens()) {
                String s = null;
                try {
                    s = br.readLine();
                } catch (IOException e) {
                    e.printStackTrace();
                }
                if (s == null)
                    return false;
                st = new StringTokenizer(s);
            }
            return true;
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
            return Long.parseLong(next());
        }
        public double nextDouble() {
            return Double.parseDouble(next());
        }
    }
}