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>
from decimal import Decimal

class Point:

	def __init__(self,x,y):
		self.x = x
		self.y = y
		
	def __eq__(self, other):
		return self.x == other.x and self.y == other.y	

	def __hash__(self):
		return 	self.x.__hash__()^self.y.__hash__()

class Line:
	
	def __init__(self,p1,p2):
		self.A = p1.y - p2.y
		self.B = p2.x - p1.x
		self.C = p1.x*p2.y - p2.x*p1.y
		
	def isPointOnLine(self,p):
		if (self.A*p.x + self.B*p.y + self.C) == 0:
			return True
		else:
			return False
			
	def __eq__(self, line):
		if ((self.A==0) != (line.A == 0)) or ((self.B==0) != (line.B == 0)) or ((self.C==0) != (line.C == 0)):
			return False

		t = 0
		if self.A != 0:	
			t = Decimal(self.A)/Decimal(line.A)
		if self.B != 0:
			if t == 0:
				t = Decimal(self.B)/Decimal(line.B)
			else:
				if t != Decimal(self.B)/Decimal(line.B):
					return False

		if self.C != 0:
			if t == 0:
				t = Decimal(self.C)/Decimal(line.C)
			else:
				if t != Decimal(self.C)/Decimal(line.C):
					return False
						
		return True		

#in

n = int(input())
points = []
for i in range(0,n):
	a = list(map(int,input().split()))
	points.append(Point(a[0],a[1]))

#calc
ans = ""
if n < 5:	
	ans = "Yes"
else:	
	lines = []
	linePoints = []
	
	lines.append(Line(points[0], points[1]))
	linePoints.append([points[0], points[1]])	
		
	for i in range(1, 5):
		for j in range(0, i):			
			if i != j:
				line = Line(points[i], points[j])				
				exist = False				
				for k in range(0, len(lines)):
					if lines[k] == line:						
						exist = True						
						existP = False
						for p in range(0, len(linePoints[k])):
							if linePoints[k][p] == points[i]:								
								existP = True
								break

						if not existP:							
							linePoints[k].append(points[i])
				
				if not exist:					
					lines.append(Line(points[i],points[j]))
					linePoints.append([points[i],points[j]])
	

	
	firstLine = 0
	secondLine = 0 
	i_point = 0
	if len(lines) == 9:
		ans == "No"           
	else:
		if len(lines) == 8 or len(lines) == 6:			
			for i in range(0, len(linePoints)):         
				if len(linePoints[i]) == 3:					
					firstLine = i
				
			for i in range(0, len(linePoints)):             
				if len(set(linePoints[i])-set(linePoints[firstLine])) == 2:				
					secondLine = i
			
			lines = [lines[firstLine], lines[secondLine]]
			linePoints = [linePoints[firstLine], linePoints[secondLine]]
			
			
				
		elif len(lines) == 5:			
			for i in range(0, len(linePoints)):         
				if len(linePoints[i]) == 4:					
					firstLine = i		

			fifth_point = list(set(points[:5])-set(linePoints[firstLine]))[0]				
			if len(points) > 5:		
				for i in range(5, len(points)):
					exist = False
					if not lines[firstLine].isPointOnLine(points[i]):						
						six_point = points[i]
						lines = [lines[firstLine], Line(fifth_point, six_point)]
						i_point = i + 1						
						exist = True
						break
				if not exist:					
					ans = "Yes"			
			else:				
				ans = "Yes"	
		elif len(lines) == 1:
			if len(points) > 5:		
				for i in range(5, len(points)):
					exist = False
					if not lines[0].isPointOnLine(points[i]):						
						first_point = points[i]						
						i_point = i + 1						
						exist = True
						break

				if exist:					
					if len(points) > i_point:
						for i in range(i_point, len(points)):
							exist = False
							if not lines[0].isPointOnLine(points[i]):						
								second_point = points[i]						
								i_point = i + 1								
								exist = True
								lines = [lines[0], Line(first_point, second_point)]
								break

						if not exist:							
							ans = "Yes"				
					else:							
						ans = "Yes"		
				else:						
					ans = "Yes"		
			else:				
				ans = "Yes"	

			
		if ans == "" and len(points) > i_point:
			exist = False
			for i in range(i_point, len(points)):
				if not (lines[0].isPointOnLine(points[i]) or lines[1].isPointOnLine(points[i])):					
					exist = True
					ans = "No"
					break
			if not exist:				
				ans = "Yes"		
		else:			
			ans = "Yes"

				
	
#out
print(ans)

       
