#include<iostream>
#include<algorithm>
#include<string>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<stack>
#include<queue>

using namespace std;
typedef long long ll;
const int MOD = 10000007;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
const int maxn = 1010;
int a[maxn];

int main()
{
	int n;
	scanf("%d",&n);
	int cnt = 0;
	int x,y;
	for(int i=1;i<=n;i++)
	{
		scanf("%d%d",&x,&y);
		if(x>0)
			cnt++;
	}
	if(cnt==0||cnt==1||n-cnt==0||n-cnt==1)
		printf("Yes\n");
	else
		printf("No\n");
		
	return 0;
}