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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class D {

	public static void main(String[] args){
		FastScanner scan = new FastScanner();
		PrintWriter out = new PrintWriter(System.out);
		int n = scan.nextInt();
		int[] x = new int[n];
		int[] y = new int[n];
		for(int i = 0; i < n; i++) {
			x[i] = scan.nextInt();
			y[i] = scan.nextInt();
		}
		if(n <= 4) out.println("YES");
		else {
			boolean gucci = false;
			for(int k = 0; k < 4; k++) {
				for(int i = k+1; i < 4; i++) {
					int mx = x[k]-x[i];
					int my = y[k]-y[i];
					int gcd = gcd(mx, my);
					mx /= gcd;
					my /= gcd;
//					System.out.println(k+" "+i+" "+mx+" "+my);
					boolean[] v = new boolean[n];
					v[k] = true;
					for(int j = 0; j < n; j++) {
						int dx = x[k]-x[j];
						int dy = y[k]-y[j];
//						System.out.println(dx+" "+dy);
//						if(mx == 1 && my == 1) System.out.println("S: "+dx%mx+" "+dy%my+" "+dx/mx+" "+dy/my);
						if((mx==0?dx==0:dx%mx==0) && (my==0?dy==0:dy%my == 0) && (mx==0||my==0?true:dx/mx == dy/my)) {
							v[j] = true;
//							System.out.println("FUCK YEAH");
						}
					}
					boolean f1 = false, f2 = false;
					int x1 = 0, y1 = 0, x2 = 0, y2 = 0, mx2 = 0, my2 = 0;
					for(int j = 0; j < n; j++) if(!v[j]){
						if(!f1) {
							x1 = x[j];
							y1 = y[j];
							f1 = true;
							v[j] = true;
						} else if(!f2) {
							x2 = x[j];
							y2 = y[j];
							f2 = true;
							mx2 = x1-x2;
							my2 = y1-y2;
							int gcd2 = gcd(mx2, my2);
							mx2 /= gcd2;
							my2 /= gcd2;
							v[j] = true;
						} else {
							int dx = x1-x[j];
							int dy = y1-y[j];
							if((mx2==0?dx==0:dx%mx2==0) && (my2==0?dy==0:dy%my2 == 0) && (mx2==0||my2==0?true:dx/mx2 == dy/my2)) v[j] = true;
						}
					}
//					System.out.println(mx2+" "+my2+" "+x1+" "+y1+" "+x2+" "+y2);
					boolean nice = true;
					for(int j = 0; j < n; j++) nice &= v[j];
					gucci |= nice;
				}
			}
			out.print(gucci?"YES":"NO");
		}
		out.close();
	}

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

	static class FastScanner {
		BufferedReader br;
		StringTokenizer st;

		public FastScanner() {
			try	{
				br = new BufferedReader(new InputStreamReader(System.in));
				st = new StringTokenizer(br.readLine());
			} catch (Exception e){e.printStackTrace();}
		}

		public String next() {
			if (st.hasMoreTokens())	return st.nextToken();
			try {st = new StringTokenizer(br.readLine());}
			catch (Exception e) {e.printStackTrace();}
			return st.nextToken();
		}

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

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

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

		public String nextLine() {
			String line = "";
			if(st.hasMoreTokens()) line = st.nextToken();
			else try {return br.readLine();}catch(IOException e){e.printStackTrace();}
			while(st.hasMoreTokens()) line += " "+st.nextToken();
			return line;
		}

		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for(int i = 0; i < n; i++) a[i] = nextInt();
			return a;
		}

		public long[] nextLongArray(int n){
			long[] a = new long[n];
			for(int i = 0; i < n; i++) a[i] = nextLong();
			return a;
		}

		public double[] nextDoubleArray(int n){
			double[] a = new double[n];
			for(int i = 0; i < n; i++) a[i] = nextDouble();
			return a;
		}

		public char[][] nextGrid(int n, int m){
			char[][] grid = new char[n][m];
			for(int i = 0; i < n; i++) grid[i] = next().toCharArray();
			return grid;
		}
	}


}
