n=int(input())
l=[]
g=0
h=0
for i in range (0 , n):
l=[int(num) for num in input().split()]
if l[0]>0:
h=h+1
else:
g=g+1
if g==1 or h==1 or h==0 or g==0 :
print("YES")
else:
print('NO')
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define elif else if
#define pow pwr
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const ll N=2e5+10;
const int mod = 1e9+7;
int main(){
ll n;
cin>>n;
vector<vector<ll>> points(n, vector<ll>(2, 0));
for(ll i = 0; i < n; ++i){
for(ll j = 0; j < 2; ++j){
cin>>points[i][j];
}
}
ll ct_pos = 0, ct_neg = 0;
for(ll i = 0; i < n; ++i){
if(points[i][0] > 0){
ct_pos++;
}else{
ct_neg++;
}
}
if(ct_pos > 0 && ct_neg > 0 && ct_pos != 1 && ct_neg != 1){
cout<<"No";
}else{
cout<<"Yes";
}
return 0;
}print(5)
1225A - Forgetting Things | 1717A - Madoka and Strange Thoughts |
1717B - Madoka and Underground Competitions | 61B - Hard Work |
959B - Mahmoud and Ehab and the message | 802G - Fake News (easy) |
1717C - Madoka and Formal Statement | 420A - Start Up |
1031A - Golden Plate | 1559C - Mocha and Hiking |
427B - Prison Transfer | 330A - Cakeminator |
426A - Sereja and Mugs | 363A - Soroban |
1585C - Minimize Distance | 1506E - Restoring the Permutation |
1539A - Contest Start | 363D - Renting Bikes |
1198D - Rectangle Painting 1 | 1023B - Pair of Toys |
1725A - Accumulation of Dominoes | 1675E - Replace With the Previous Minimize |
839A - Arya and Bran | 16B - Burglar and Matches |
1625B - Elementary Particles | 1725G - Garage |
1725B - Basketball Together | 735A - Ostap and Grasshopper |
1183B - Equalize Prices | 1481A - Space Navigation |