Find Extra One

Description:

Input:

The first line contains a single positive integer n (2 ≤ n ≤ 10⁵).

The following n lines contain coordinates of the points. The i-th of these lines contains two single integers x_i and y_i (|x_i|, |y_i| ≤ 10⁹, x_i ≠ 0). No two points coincide.

Output:

Print "Yes" if there is such a point, "No" — otherwise.

You can print every letter in any case (upper or lower).

Sample Input:

3
1 1
-1 -1
2 -1

Sample Output:

Yes

Sample Input:

4
1 1
2 2
-1 1
-2 2

Sample Output:

No

Sample Input:

3
1 2
2 1
4 60

Sample Output:

Yes

Note:

In the first example the second point can be removed.

In the second example there is no suitable for the condition point.

In the third example any point can be removed.