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 codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Codechef
{
	public class Obj implements Comparable<Obj>{
        public int start;
        public int end;
        
        public Obj(int start_, int end_){
            this.start = start_;
            this.end = end_;

        }
        
        public int compareTo(Obj other){
            if (other.start == this.start){
                return this.end - other.end;
            }
            return this.start - other.start;
        }

    }
    
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
        Codechef cf = new Codechef();
        cf.Solve();
	}
	
	int n;
	public void Solve(){
        MyScanner sc = new MyScanner();
        n = sc.nextInt();
        long[][] P = new long[n][2];
        for (int i = 0; i < n; ++i){
            P[i][0] = sc.nextLong();
            P[i][1] = sc.nextLong();
        }
        if (n <= 4){
            System.out.println("YES");
            return;
        }

        // case 1: p1 & p2 same line
        boolean ok = test(0, 1, P);
        if (ok){
            System.out.println("YES");
            return;
        }
        // case 2: p1 & p2 diff line
        // p1 & p3 same line
        ok = test(0, 2, P);
        if (ok){
            System.out.println("YES");
            return;
        }
        
        // p1 & p3 dif line
        ok = test(1, 2, P);
        if (ok){
            System.out.println("YES");
            return;
        }
        
        System.out.println("NO");
	}
	
	public boolean test(int i1, int i2, long[][] P){
	    long[] e1 = new long[3];
        long[] e2 = new long[3];

        makeE(P[i1], P[i2], e1);
        // System.out.println("e1: " + " a: " + e1[0] + " b: " + e1[1] + " c: " + e1[2]);
        boolean[] ok = new boolean[n];
        int[] rem = new int[n];
        int sz = 0;
        for (int i = 0; i < n; ++i){
            ok[i] = testP(P[i], e1);
            if (!ok[i]){
                rem[sz++] = i;
            }
        }
        if (sz < 2) return true;
        
        makeE(P[rem[0]], P[rem[1]], e2);
        boolean remOk = true;
        for (int i = 0; i < n; ++i){
            if (ok[i]) continue;
            ok[i] = testP(P[i], e2);
            if (!ok[i]){
                remOk = false;
                break;
            }
        }
        if (remOk){
            return true;
        }
        return false;
	}
	
	public void makeE(long[] p1, long[] p2, long[] e){
	    e[0] = p2[1] - p1[1];
	   // System.out.println(p2[1] + " p1[1]: " + p1[1]);
	    e[1] = p1[0] - p2[0];
	   // System.out.println(p1[0] + " p2[0]: " + p2[0]);
	    e[2] = e[0] * p1[0] + e[1] * p1[1];
	}
	
	public boolean testP(long[] p, long[] e){
	   // System.out.println("P len: " + p.length);
	    return (e[2] == e[0] * p[0] + e[1] * p[1]);
	}

	//-----------PrintWriter for faster output---------------------------------
   public static PrintWriter out;
      
   //-----------MyScanner class for faster input----------
   public static class MyScanner {
      BufferedReader br;
      StringTokenizer st;
 
      public MyScanner() {
         br = new BufferedReader(new InputStreamReader(System.in));
      }
 
      String next() {
          while (st == null || !st.hasMoreElements()) {
              try {
                  st = new StringTokenizer(br.readLine());
              } catch (IOException e) {
                  e.printStackTrace();
              }
          }
          return st.nextToken();
      }
 
      int nextInt() {
          return Integer.parseInt(next());
      }
 
      long nextLong() {
          return Long.parseLong(next());
      }
 
      double nextDouble() {
          return Double.parseDouble(next());
      }
 
      String nextLine(){
          String str = "";
      try {
         str = br.readLine();
      } catch (IOException e) {
         e.printStackTrace();
      }
      return str;
      }

   }
}
