#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")


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]) {
// if(t<INF)cerr<<__LINE__<<"> i = "<<i<<", j = "<<j<<", 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]) {
// if(t<INF)cerr<<__LINE__<<"> i = "<<i<<", j = "<<j<<", t = "<<t<<endl;
            chmin(fs[i], t);
          }
        }
      } else {
        {
          const Int tt = max(T[ps[i]] + dist(ps[i], j+1), fs[j] + dist(j, j+1));
          if (tt <= T[j+1]) {
// if(fs[j]<INF)cerr<<__LINE__<<"> i = "<<i<<", j = "<<j<<", fs[j] = "<<fs[j]<<endl;
            chmin(fs[i], fs[j]);
          }
        }
        {
          const Int tt = gs[j] + dist(j, j+1);
          if (tt <= T[j+1]) {
// if(gs[j]<INF)cerr<<__LINE__<<"> i = "<<i<<", j = "<<j<<", gs[j] = "<<gs[j]<<endl;
            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)});
// if(t<INF)cerr<<__LINE__<<"> i = "<<i<<", i-1 = "<<i-1<<", t = "<<t<<endl;
        chmin(gs[i], t);
      }
      {
        const Int t = max(T[i-1], gs[i-1] + dist(i-1, i));
// if(t<INF)cerr<<__LINE__<<"> i = "<<i<<", i-1 = "<<i-1<<", t = "<<t<<endl;
        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;
  }
  return (min(fs[N], gs[N]) < INF);
}
}  // slow


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 = slow::run();
    puts(ans ? "YES" : "NO");
  }
  return 0;
}