Christmas Day is coming! To celebrate this great festival, Kuangyeye, a creative boy, wants to play a game with everyone. The rule is described as following: there are several balloons in the classroom, and you have a prop gun. To achieve a higher goal, you need to shoot as many balloons as you can with one bullet. Now you have to judge whether you can explosive all balloons with one shoot. In a rigorous word, there are n points on the plane, you need to judge if they are on the same line. In addition, the balloons may extremely tiny, so some of them may share the same coordinate.

The first line contains an integer $n$ which indicates the number of balloons. The next $n$ following
lines contain two integers $x_i$ and $y_i$, which represent the $X$ coordinate and the $Y$ coordinate of $i$-th balloon respectively.
$1 ≤n≤1000,1≤|x_i|,|y_i|≤1000$

If you can explosive all balloons with one shoot, output "Yes". Output "No" otherwise(without quotes).

In the first sample, These two ballons are all on the line $x-y=0$.
In the second sample, We can't find a line which all these ballons on it.