#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


// [0, n), 0 <= n <= 2^(6D)
template <int D> struct Set {
  int n;
  vector<unsigned long long> a[D];
  explicit Set(int n_ = 0) : n(n_) {
    static_assert(1 <= D && D <= 6, "Set: 1 <= D <= 6 must hold");
    assert(0 <= n); assert(n <= 1LL << (6 * D));
    int m = n ? n : 1;
    for (int d = 0; d < D; ++d) {
      m = (m + 63) >> 6;
      a[d].assign(m, 0);
    }
  }
  bool empty() const {
    return !a[D - 1][0];
  }
  bool contains(int x) const {
    return (a[0][x >> 6] >> (x & 63)) & 1;
  }
  void insert(int x) {
    for (int d = 0; d < D; ++d) {
      const int q = x >> 6, r = x & 63;
      a[d][q] |= 1ULL << r;
      x = q;
    }
  }
  void erase(int x) {
    for (int d = 0; d < D; ++d) {
      const int q = x >> 6, r = x & 63;
      if ((a[d][q] &= ~(1ULL << r))) break;
      x = q;
    }
  }
  // min s.t. >= x
  int next(int x) const {
    for (int d = 0; d < D; ++d) {
      const int q = x >> 6, r = x & 63;
      if (static_cast<unsigned>(q) >= a[d].size()) break;
      const unsigned long long upper = a[d][q] >> r;
      if (upper) {
        x += __builtin_ctzll(upper);
        for (int e = d - 1; e >= 0; --e) x = x << 6 | __builtin_ctzll(a[e][x]);
        return x;
      }
      x = q + 1;
    }
    return n;
  }
  // max s.t. <= x
  int prev(int x) const {
    for (int d = 0; d < D; ++d) {
      if (x < 0) break;
      const int q = x >> 6, r = x & 63;
      const unsigned long long lower = a[d][q] << (63 - r);
      if (lower) {
        x -= __builtin_clzll(lower);
        for (int e = d - 1; e >= 0; --e) x = x << 6 | (63 - __builtin_clzll(a[e][x]));
        return x;
      }
      x = q - 1;
    }
    return -1;
  }
};

////////////////////////////////////////////////////////////////////////////////


constexpr Int INF = 1001001001001001001LL;

int N;
vector<Int> T, X;

inline Int dist(int i, int j) {
  return abs(X[i] - X[j]);
}

namespace slow {
/*
  min time to put clone at X[i], completing events [0, ps[i]]
    fs[i]: event ps[i] is taken by self
    gs[i]: event ps[i] is taken by clone
*/
bool run() {
  vector<int> necks(N + 1, 0);
  for (int i = 0; i < N; ++i) {
    necks[i + 1] = necks[i] + ((T[i] + dist(i, i + 1) > T[i + 1]) ? 1 : 0);
  }
// cerr<<"necks = "<<necks<<endl;
  vector<int> ps(N + 1, 0);
  for (int i = 1; i <= N; ++i) {
    ps[i] = (i - 1 >= 1 && X[i - 1] == X[i]) ? ps[i - 1] : (i - 1);
  }
// cerr<<"ps = "<<ps<<endl;
  vector<Int> fs(N + 1, INF), gs(N + 1, INF);
  fs[0] = gs[0] = 0;
  for (int i = 1; i <= N; ++i) {
    for (int j = 0; j <= i - 2; ++j) if (necks[j+1] == necks[i-1]) {
      if (X[j] != X[i]) {
        // j -> (put i) -> j+1 -> ... -> i-1
        {
          const Int t = max({T[ps[j]] + dist(ps[j], i), T[j], fs[j] + dist(j, i)});
          if (t + dist(i, j+1) <= T[j+1]) {
            chmin(fs[i], t);
          }
        }
        {
          const Int t = max(T[j], gs[j] + dist(j, i));
          if (t + dist(i, j+1) <= T[j+1]) {
            chmin(fs[i], t);
          }
        }
      } else {
        if (max(T[ps[j]] + dist(ps[j], j+1), fs[j] + dist(j, j+1)) <= T[j+1]) {
          chmin(fs[i], fs[j]);
        }
        if (gs[j] + dist(j, j+1) <= T[j+1]) {
          chmin(fs[i], gs[j]);
        }
      }
    }
    if (X[i-1] != X[i]) {
      {
        const Int t = max({T[ps[i-1]] + dist(ps[i-1], i), T[i-1], fs[i-1] + dist(i-1, i)});
        chmin(gs[i], t);
      }
      {
        const Int t = max(T[i-1], gs[i-1] + dist(i-1, i));
        chmin(gs[i], t);
      }
    } else {
      chmin(fs[i], fs[i-1]);
      chmin(gs[i], gs[i-1]);
    }
    if (fs[i] > T[i]) fs[i] = INF;
    if (gs[i] > T[i]) gs[i] = INF;
// cerr<<COLOR("33")<<"i = "<<i<<": "<<T[i]<<" "<<X[i]<<": "<<fs[i]<<" "<<gs[i]<<COLOR()<<endl;
  }
cerr<<"fs = "<<fs<<endl;
cerr<<"gs = "<<gs<<endl;
  return (min(fs[N], gs[N]) < INF);
}
}  // slow


namespace fast {
/*
  min time to put clone at X[i], completing events [0, ps[i]]
    fs[i]: event ps[i] is taken by self
    gs[i]: event ps[i] is taken by clone
*/
bool run() {
  vector<int> necks(N + 1, 0);
  for (int i = 0; i < N; ++i) {
    necks[i + 1] = necks[i] + ((T[i] + dist(i, i + 1) > T[i + 1]) ? 1 : 0);
  }
// cerr<<"necks = "<<necks<<endl;
  vector<int> ps(N + 1, 0);
  for (int i = 1; i <= N; ++i) {
    ps[i] = (i - 1 >= 1 && X[i - 1] == X[i]) ? ps[i - 1] : (i - 1);
  }
// cerr<<"ps = "<<ps<<endl;
  
  auto xs = X;
  sort(xs.begin(), xs.end());
  xs.erase(unique(xs.begin(), xs.end()), xs.end());
  const int xsLen = xs.size();
  vector<int> poss(N + 1);
  for (int i = 0; i <= N; ++i) {
    poss[i] = lower_bound(xs.begin(), xs.end(), X[i]) - xs.begin();
  }
  
  vector<pair<Int, int>> xis(N + 1);
  for (int i = 0; i <= N; ++i) {
    xis[i] = make_pair(X[i], i);
  }
  sort(xis.begin(), xis.end());
  vector<int> ids(N + 1, -1);
  for (int k = 0; k <= N; ++k) {
    ids[xis[k].second] = k;
  }
  
  vector<Int> fs(N + 1, INF), gs(N + 1, INF);
  fs[0] = gs[0] = 0;
  
  // j <= i-2 && X[j] != X[i]
  Set<4> ksDiff(N + 1);
  // j <= i-2 && X[j] == X[i]
  vector<Int> same(xsLen, INF);
  vector<int> ksSame;
  int iDiff = 2;
  
  for (int i = 1; i <= N; ++i) {
    if (i-2 >= 0) {
      if (necks[i-2] != necks[i-1]) {
        for (const int k : ksSame) {
          same[k] = INF;
        }
        ksSame.clear();
      }
      // transfer from j
      const int j = i-2;
#define i another_i
      for (; iDiff <= N; ++iDiff) {
        if (j <= iDiff-2) {
          if (necks[j+1] != necks[iDiff-1]) {
            break;
          }
          ksDiff.insert(ids[iDiff]);
        }
      }
      for (int dir = 0; dir < 2; ++dir) {
        for (; ; ) {
          const int k = dir ? ksDiff.prev(ids[j]) : ksDiff.next(ids[j]);
          if (!(0 <= k && k <= N)) break;
          const int i = xis[k].second;
          bool upd = false;
          if (j <= i-2 && necks[j+1] == necks[i-1]) {
            {
              const Int t = max({T[ps[j]] + dist(ps[j], i), T[j], fs[j] + dist(j, i)});
              if (t + dist(i, j+1) <= T[j+1]) {
// cerr<<"[fast fs] j = "<<j<<", i = "<<i<<", t = "<<t<<endl;
                upd = true;
                ksDiff.erase(k);
                chmin(fs[i], t);
              }
            }
            {
              const Int t = max(T[j], gs[j] + dist(j, i));
              if (t + dist(i, j+1) <= T[j+1]) {
// cerr<<"[fast gs] j = "<<j<<", i = "<<i<<", t = "<<t<<endl;
                upd = true;
                ksDiff.erase(k);
                chmin(fs[i], t);
              }
            }
          } else {
            upd = true;
            ksDiff.erase(k);
          }
          if (!upd) break;
        }
      }
#undef i
#define i do_not_depend_on_i
      if (max(T[ps[j]] + dist(ps[j], j+1), fs[j] + dist(j, j+1)) <= T[j+1]) {
        chmin(same[poss[j]], fs[j]);
      }
      if (gs[j] + dist(j, j+1) <= T[j+1]) {
        chmin(same[poss[j]], gs[j]);
      }
      ksSame.push_back(poss[j]);
#undef i
    }
    /*
    for (int j = 0; j <= i - 2; ++j) if (necks[j+1] == necks[i-1]) {
      if (X[j] != X[i]) {
        // j -> (put i) -> j+1 -> ... -> i-1
        {
          const Int t = max({T[ps[j]] + dist(ps[j], i), T[j], fs[j] + dist(j, i)});
          if (t + dist(i, j+1) <= T[j+1]) {
cerr<<"[brute fs] j = "<<j<<", i = "<<i<<", t = "<<t<<endl;
            // chmin(fs[i], t);
          }
        }
        {
          const Int t = max(T[j], gs[j] + dist(j, i));
          if (t + dist(i, j+1) <= T[j+1]) {
cerr<<"[brute gs] j = "<<j<<", i = "<<i<<", t = "<<t<<endl;
            // chmin(fs[i], t);
          }
        }
      }
    }
    */
    chmin(fs[i], same[poss[i]]);
    if (X[i-1] != X[i]) {
      {
        const Int t = max({T[ps[i-1]] + dist(ps[i-1], i), T[i-1], fs[i-1] + dist(i-1, i)});
        chmin(gs[i], t);
      }
      {
        const Int t = max(T[i-1], gs[i-1] + dist(i-1, i));
        chmin(gs[i], t);
      }
    } else {
      chmin(fs[i], fs[i-1]);
      chmin(gs[i], gs[i-1]);
    }
    if (fs[i] > T[i]) fs[i] = INF;
    if (gs[i] > T[i]) gs[i] = INF;
// cerr<<COLOR("33")<<"i = "<<i<<": "<<T[i]<<" "<<X[i]<<": "<<fs[i]<<" "<<gs[i]<<COLOR()<<endl;
  }
#ifdef LOCAL
cerr<<"fs = "<<fs<<endl;
cerr<<"gs = "<<gs<<endl;
#endif
  return (min(fs[N], gs[N]) < INF);
}
}  // fast


int main() {
  for (; ~scanf("%d", &N); ) {
    T.resize(N + 1);
    X.resize(N + 1);
    for (int i = 1; i <= N; ++i) {
      scanf("%lld%lld", &T[i], &X[i]);
    }
    T[0] = 0;
    X[0] = 0;
    
    const bool ans = fast::run();
    puts(ans ? "YES" : "NO");
#ifdef LOCAL
const bool brt=slow::run();
cerr<<"brt = "<<(brt?"YES":"NO")<<endl;
assert(brt==ans);
cerr<<string(80,'=')<<endl;
#endif
  }
  return 0;
}