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

public class D {
static point []points;	
	static boolean isColinear(point a,point b,point c)
	{
		if(b.x ==a.x)
		{
			return c.x==a.x;
		}
		else
		{
			long dy1=b.y-a.y;
			long dx1=b.x-a.x;
			long dy2=c.y-a.y;
			long dx2=c.x-a.x;
			return dy2*dx1==dy1*dx2;
		}
		
		
	}
	
	public static boolean check(line l1,line l2)
	{
		
		for(int i=3;i<points.length;i++)
		{
			
			point p=points[i];
			if(!l1.lies(p))
			{
				if(l2.a==null)
					l2.a=p;
				else if(l2.b==null)
					l2.b=p;
				else if(!l2.lies(p))
						return false;
				
			}
			
		}
		return true;
	}

	public static void main(String[] args) throws IOException {
		Scanner sc=new Scanner(System.in);
		PrintWriter pw=new PrintWriter(System.out);
		int n=sc.nextInt();
		if(n<=3)
		{
			System.out.println("YES");
			return ;
		}
		points=new point[n];
		for(int i=0;i<n;i++)
			points[i]=new point(sc.nextInt(),sc.nextInt());
		line l1,l2;
		l2=new line(null,null);
		boolean ok=false;
		if(isColinear(points[0],points[1],points[2]))
		{
			
			
			l1=new line(points[0],points[1]);
			ok=check(l1,l2);
			
			
		}
		
		for(int i=0;i<3 &&!ok;i++)
			for(int j=i+1;j<3;j++)
			{
				
				l1=new line(points[i],points[j]);
				l2.a=points[3-i-j];
				l2.b=null;
				ok|=check(l1,l2);
			}
		
		System.out.println(ok?"YES":"NO");
		pw.close();

	}
	static class line
	{
		point a,b;
		public line (point a,point b)
		{
			this.a=a;
			this.b=b;
			
		}
		boolean lies(point p)
		{
			return isColinear(p,a,b);
				
		}
	}
	static class point
	{
		int x,y;
		point (int a,int b)
		{
			x=a;y=b;
		}
		
	}
	static class Scanner
	{
		BufferedReader br;
		StringTokenizer st;
		public Scanner(InputStream s)
		{
			br=new BufferedReader(new InputStreamReader(s));
		}
		public String nextLine() throws IOException
		{
			return br.readLine();
		}
		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 double nextDouble() throws IOException
		{
			return Double.parseDouble(next());
		}
		public boolean ready() throws IOException
		{
			return br.ready();
		}
		public long nextLong() throws IOException
		{
			return Long.parseLong(next());
		}
	}
}
