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.util.*;
import java.math.*;
import java.io.*;

public class CF961D {

	class Point {
		long x, y;
		public Point(long xx, long yy) {x = xx; y = yy;}
	}
	
	class Line {
		Point a, b;
		public Line(Point aa, Point bb) {a = aa; b = bb;}
		boolean isColinear(Point p) {
			long[][] matrix = {{a.x, a.y, 1},
			                   {b.x, b.y, 1},
			                   {p.x, p.y, 1}};
			long res = 0;
			for(int i = 0 ; i < 3 ; i++) {
				long[][] subMatrix = {{matrix[1][(i + 1) % 3], matrix[1][(i + 2) % 3]},
				                      {matrix[2][(i + 1) % 3], matrix[2][(i + 2) % 3]}};
				res += matrix[0][i] * det(subMatrix);
			}
			return res == 0;
		}
	}
	
	final int MOD = (int) 1e9 + 7;
	final double ERROR = 1e-9;
	final double oo = 1e50;

	public CF961D(SuperScanner scan, PrintWriter out) {
		int n = scan.nextInt();
		Point[] p = new Point[n];
		for(int i = 0 ; i < n ; i++)
			p[i] = new Point(scan.nextLong(), scan.nextLong());
		if(n <= 4) {
			out.println("YES");
		} else {
			Line l1 = new Line(p[0], p[1]);
			Line l2 = new Line(p[0], p[2]);
			Line l3 = new Line(p[1], p[2]);
			if(works(l1, p) || works(l2, p) || works(l3, p))
				out.println("YES");
			else
				out.println("NO");
		}
	}
	
	boolean works(Line l, Point[] p) {
		int n = p.length;
		boolean[] used = new boolean[n];
		for(int i = 0 ; i < n ; i++)
			if(l.isColinear(p[i]))
				used[i] = true;
		int ii = -1, jj = -1;
		for(int i = 0 ; i < n ; i++) {
			if(!used[i]) {
				if(ii == -1) {
					ii = i;
				} else {
					jj = i;
					break;
				}
			}
		}
		if(ii == -1 || jj == -1)
			return true;
		Line L = new Line(p[ii], p[jj]);
		for(int i = 0 ; i < n ; i++)
			if(L.isColinear(p[i]))
				used[i] = true;
		for(int i = 0 ; i < n ; i++)
			if(!used[i])
				return false;
		return true;
	}
	
	long det(long[][] matrix) {
		return (matrix[0][0] * matrix[1][1]) - (matrix[0][1] * matrix[1][0]);
	}
	
	static class SuperScanner {
		public int BS = 1 << 16;
		public char NC = (char) 0;
		byte[] buf = new byte[BS];
		int bId = 0, size = 0;
		char c = NC;
		double num = 1;
		BufferedInputStream in;

		public SuperScanner() {
			in = new BufferedInputStream(System.in, BS);
		}

		public SuperScanner(String s) throws FileNotFoundException {
			in = new BufferedInputStream(new FileInputStream(new File(s)), BS);
		}

		public char nextChar() {
			while (bId == size) {
				try {
					size = in.read(buf);
				} catch (Exception e) {
					return NC;
				}
				if (size == -1)
					return NC;
				bId = 0;
			}
			return (char) buf[bId++];
		}

		public int nextInt() {
			return (int) nextLong();
		}

		public long nextLong() {
			num = 1;
			boolean neg = false;
			if (c == NC)
				c = nextChar();
			for (; (c < '0' || c > '9'); c = nextChar()) {
				if (c == '-')
					neg = true;
			}
			long res = 0;
			for (; c >= '0' && c <= '9'; c = nextChar()) {
				res = (res << 3) + (res << 1) + c - '0';
				num *= 10;
			}
			return neg ? -res : res;
		}

		public double nextDouble() {
			double cur = nextLong();
			return c != '.' ? cur : cur + nextLong() / num;
		}

		public String next() {
			StringBuilder res = new StringBuilder();
			while (c <= 32)
				c = nextChar();
			while (c > 32) {
				res.append(c);
				c = nextChar();
			}
			return res.toString();
		}

		public String nextLine() {
			StringBuilder res = new StringBuilder();
			while (c <= 32)
				c = nextChar();
			while (c != '\n') {
				res.append(c);
				c = nextChar();
			}
			return res.toString();
		}

		public boolean hasNext() {
			if (c > 32)
				return true;
			while (true) {
				c = nextChar();
				if (c == NC)
					return false;
				else if (c > 32)
					return true;
			}
		}
	}

	public static void main(String[] args) {
		SuperScanner scan = new SuperScanner();
		PrintWriter out = new PrintWriter(System.out);
		new CF961D(scan, out);
		out.close();
	}
}
