#include <bits/stdc++.h>
using namespace std;
long long modd = 1000 * 1000 * 1000 + 7;
template <class T>
class depth_first_search_iterator {
 public:
  stack<pair<T, T>> todo;
  function<bool(T)> notvisited;
  function<void(T)> mark_visited;
  function<set<T>(T)> neighbors;
  depth_first_search_iterator() {}
  depth_first_search_iterator(T start, function<bool(T)> notv,
                              function<void(T)> mark_v,
                              function<set<T>(T)> neigh)
      : notvisited(notv),
        mark_visited(mark_v),
        neighbors(neigh),
        end_(false),
        current(start),
        prev(start) {
    todo.push(make_pair(start, start));
    operator++();
  }
  void operator++() {
    end_ = true;
    while (!todo.empty()) {
      current = todo.top().first;
      prev = todo.top().second;
      todo.pop();
      if (notvisited(current)) {
        mark_visited(current);
        for (const T x : neighbors(current)) {
          todo.push(make_pair(x, current));
        }
        end_ = false;
        break;
      }
    }
  }
  T operator*() { return current; }
  T previous() { return prev; }
  bool end() { return end_; }

 private:
  T current;
  T prev;
  bool end_;
};
template <class T>
class breadth_first_search_iterator {
 public:
  queue<pair<T, T>> todo;
  function<bool(T)> notvisited;
  function<void(T)> mark_visited;
  function<set<T>(T)> neighbors;
  breadth_first_search_iterator() {}
  breadth_first_search_iterator(T start, function<bool(T)> notv,
                                function<void(T)> mark_v,
                                function<set<T>(T)> neigh)
      : notvisited(notv),
        mark_visited(mark_v),
        neighbors(neigh),
        end_(false),
        current(start),
        prev(start) {
    todo.push(make_pair(start, start));
    operator++();
  }
  void operator++() {
    end_ = true;
    while (!todo.empty()) {
      current = todo.front().first;
      prev = todo.front().second;
      todo.pop();
      if (notvisited(current)) {
        mark_visited(current);
        for (const T x : neighbors(current)) {
          todo.push(make_pair(x, current));
        }
        end_ = false;
        break;
      }
    }
  }
  T operator*() { return current; }
  T previous() { return prev; }
  bool end() { return end_; }

 private:
  T current;
  T prev;
  bool end_;
};
template <class T>
class Graph {
 public:
  vector<T> vertices;
  vector<set<int>> neighbors;
  depth_first_search_iterator<int> dfs_iterator;
  breadth_first_search_iterator<int> bfs_iterator;
  vector<bool> visited;
  Graph() {}
  Graph(int n) {
    for (int i = 0; i < n; ++i) {
      AddVertex(0);
    }
  }
  void AddVertex(T val) {
    vertices.push_back(val);
    neighbors.push_back(set<int>());
  }
  bool EdgeExists(int i, int j) {
    return (neighbors[i].find(j) != neighbors[i].end());
  }
  void AddEdge(int i, int j) {
    if (!EdgeExists(i, j)) {
      neighbors[i].insert(j);
      if (i != j) {
        neighbors[j].insert(i);
      }
    }
  }
  T& operator[](int i) { return vertices[i]; }
  void RemoveEdge(int i, int j) {
    if (EdgeExists(i, j)) {
      neighbors[i].erase(find(neighbors[i].begin(), neighbors[i].end(), j));
      neighbors[j].erase(find(neighbors[j].begin(), neighbors[j].end(), i));
    }
  }
  void dfs_init(int start) {
    visited = vector<bool>(vertices.size(), false);
    dfs_iterator = depth_first_search_iterator<int>(
        start, [this](int x) { return !visited[x]; },
        [this](int x) { visited[x] = true; },
        [this](int x) { return neighbors[x]; });
  }
  void bfs_init(int start) {
    visited = vector<bool>(vertices.size(), false);
    bfs_iterator = breadth_first_search_iterator<int>(
        start, [this](int x) { return !visited[x]; },
        [this](int x) { visited[x] = true; },
        [this](int x) { return neighbors[x]; });
  }
  void print_() {
    for (int i = (0); i < (0) + (vertices.size()); ++i) {
      for (auto x : neighbors[i]) {
        if (i <= x) {
          cout << i << "-" << x << endl;
        }
      }
    }
  }
};
template <class T>
class DirectedGraph {
 public:
  vector<T> vertices;
  vector<set<int>> neighbors;
  depth_first_search_iterator<int> dfs_iterator;
  breadth_first_search_iterator<int> bfs_iterator;
  vector<bool> visited;
  DirectedGraph() {}
  DirectedGraph(int n) {
    for (int i = 0; i < n; ++i) {
      AddVertex(0);
    }
  }
  bool EdgeExists(int i_from, int j_to) {
    return (neighbors[i_from].find(j_to) != neighbors[i_from].end());
  }
  void AddVertex(T val) {
    vertices.push_back(val);
    neighbors.push_back(set<int>());
  }
  void AddEdge(int i_from, int j_to) {
    if (!EdgeExists(i_from, j_to)) {
      neighbors[i_from].insert(j_to);
    }
  }
  T& operator[](int i) { return vertices[i]; }
  void RemoveEdge(int i_from, int j_to) {
    if (EdgeExists(i_from, j_to)) {
      neighbors[i_from].erase(
          find(neighbors[i_from].begin(), neighbors[i_from].end(), j_to));
    }
  }
  DirectedGraph<T> Transpose() {
    DirectedGraph<T> ret;
    for (auto x : vertices) {
      ret.AddVertex(x);
    }
    for (int i_from = 0; i_from < vertices.size(); ++i_from) {
      for (int j_to : neighbors[i_from]) {
        ret.AddEdge(j_to, i_from);
      }
    }
    return ret;
  }
  int vertices_count() { return vertices.size(); }
  void dfs_init(int start) {
    visited = vector<bool>(vertices.size(), false);
    dfs_iterator = depth_first_search_iterator<int>(
        start, [this](int x) { return !visited[x]; },
        [this](int x) { visited[x] = true; },
        [this](int x) { return neighbors[x]; });
  }
  void bfs_init(int start) {
    visited = vector<bool>(vertices.size(), false);
    bfs_iterator = breadth_first_search_iterator<int>(
        start, [this](int x) { return !visited[x]; },
        [this](int x) { visited[x] = true; },
        [this](int x) { return neighbors[x]; });
  }
  void print_() {
    for (int i = (0); i < (0) + (vertices.size()); ++i) {
      for (auto x : neighbors[i]) {
        cout << i << "->" << x << endl;
      }
    }
  }
};
int main() {
  ios_base::sync_with_stdio(false);
  cout.precision(17);
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  uniform_int_distribution<int> rand_gen(0, modd);
  int test_cases = 1;
  for (int t = (1); t < (1) + (test_cases); ++t) {
    int n;
    cin >> n;
    vector<pair<int, int>> ints;
    vector<int> dict(2 * n + 1);
    for (int i = (0); i < (0) + (n); ++i) {
      int aa;
      cin >> aa;
      int bb;
      cin >> bb;
      ints.push_back(make_pair(aa, bb));
      dict[aa] = i;
    }
    vector<pair<int, int>> events;
    for (int i = (0); i < (0) + (ints.size()); ++i) {
      events.push_back(make_pair(ints[i].first, -i - 1));
      events.push_back(make_pair(ints[i].second, i));
    }
    sort(events.begin(), events.end());
    set<int> pts;
    Graph<int> g(n);
    long long edge_count = 0;
    for (auto e : events) {
      if (e.second < 0) {
        pts.insert(e.first);
      } else {
        int i_erase = ints[e.second].first;
        pts.erase(i_erase);
        auto it = pts.lower_bound(i_erase);
        while (it != pts.end()) {
          g.AddEdge(dict[i_erase], dict[*it]);
          ++it;
          edge_count++;
          if (edge_count > ints.size() - 1) {
            break;
          }
        }
        if (edge_count > ints.size() - 1) {
          break;
        }
      }
    }
    int verts = 0;
    g.dfs_init(0);
    while (!g.dfs_iterator.end()) {
      verts++;
      ++g.dfs_iterator;
    }
    if ((verts == n) && (edge_count == n - 1)) {
      cout << "YES" << endl;
    } else {
      cout << "NO" << endl;
    }
  }
  return 0;
}
