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



int N;
vector<Int> T, X;

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

namespace brute {
bitset<5010> dp[5010];
bool run() {
  for (int i = 0; i <= N; ++i) {
    dp[i].reset();
  }
  dp[0][0] = true;
  for (int i = 0; i < N; ++i) if (dp[i][i]) {
// cerr<<i<<": ";for(int j=0;j<=N;++j)cerr<<dp[i][j];cerr<<endl;
    // go
    if (dist(i, i + 1) <= T[i + 1] - T[i]) {
      dp[i + 1] |= dp[i];
      for (int j = i + 1; j <= N; ++j) {
        if (dist(i, j) + dist(j, i + 1) <= T[i + 1] - T[i]) {
          dp[i + 1][j] = true;
        }
      }
    }
    // clone
    if (dp[i][i + 1]) {
      if (X[i + 1] == X[N]) {
        return true;
      }
      for (int ii = i + 1; X[i + 1] == X[ii]; ++ii) {
        for (int j = ii + 1; j <= N; ++j) {
          if (max(dist(i, j), T[ii] - T[i]) + dist(j, ii + 1) <= T[ii + 1] - T[i]) {
            dp[ii + 1][j] = true;
          }
        }
      }
    }
  }
  return dp[N][N];
}
}  // brute


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