#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 10;
const int mod = 1e9 + 7;
long long n, m, k;
int a[N];
void solve() {
  cin >> n;
  int ans1 = 0, ans2 = 0;
  while (n--) {
    int x, y;
    cin >> x >> y;
    if (x > 0)
      ans1++;
    else
      ans2++;
  }
  if (ans1 < 2 || ans2 < 2)
    cout << "YES\n";
  else
    cout << "NO\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int t = 1;
  while (t--) solve();
  return 0;
}
