#include <bits/stdc++.h>
using namespace std;
const int INF = 2034567891;
const long long int INF64 = 4234567890123456789ll;
long long nc3(long long v) { return (v * (v - 1ll) * (v - 2ll)) / 6ll; }
long long nc2(long long v) { return (v * (v - 1ll)) / 2ll; }
long long int gcd(long long int a, long long int b) {
  return (b == 0 ? a : gcd(b, a % b));
}
long long int lcm(long long int a, long long int b) {
  return (a * (b / gcd(a, b)));
}
const int N = 10 + 2e6;
bool isprime(long long int n) {
  if (n < 2) return 0;
  if (n == 2) return 1;
  if (n % 2 == 0) return 0;
  for (long long int i = 3; i * i <= n; i++)
    if (n % i == 0) return 0;
  return 1;
}
double dist(pair<long long int, long long int> p1,
            pair<long long int, long long int> p2) {
  return (p1.first - p2.first) * (p1.first - p2.first) +
         (p1.second - p2.second) * (p1.second - p2.second);
}
int main() {
  long long int n;
  cin >> n;
  long long int x[n], y[n];
  long long int r = 0, l = 0;
  for (long long int i = 0; i < n; i++) {
    cin >> x[i] >> y[i];
    if (x[i] > 0)
      r++;
    else
      l++;
  }
  if (l <= 1 || r <= 1)
    cout << "Yes";
  else
    cout << "No";
}
