Find Extra One_Codeforces_900A

原题链接：http://codeforces.com/problemset/problem/900/A

A. Find Extra One

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You have n distinct points on a plane, none of them lie on OY axis. Check that there is a point after removal of which the remaining points are located on one side of the OY axis.

Input

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

The following n lines contain coordinates of the points. The i-th of these lines contains two single integers xi and yi (|xi|, |yi| ≤ 109, xi ≠ 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).

Examples

input

3
1 1
-1 -1
2 -1

output

Yes

input

4
1 1
2 2
-1 1
-2 2

output

No

input

3
1 2
2 1
4 60

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.

重点：判断横坐标大于0和小于0的个数相差是否小于等于1

#include<cstdio>
#include<algorithm>

using namespace std;

int main()
{
    int n;
    scanf("%d", &n);
    int s[100010] = {0};
    for(int i = 0; i < n; i++)
    {
        int t;
        scanf("%d%d", &s[i], &t);
    }
    int cnt1 = 0, cnt2 = 0;
    for(int i = 0; i < n; i++)
    {
        if(s[i] > 0)
            cnt1++;
        else
            cnt2++;
    }
    if(cnt1 >= n - 1 || cnt2 >= n - 1)
        printf("Yes\n");
    else
        printf("No\n");
    return 0;
}