#include <bits/stdc++.h>
using namespace std;
int n;
pair<int, int> d[25];
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> d[i].first >> d[i].second;
  sort(d, d + n);
  int s = 0;
  for (int i = 0; i < n; i++) {
    s += d[i].second;
    if (d[i].first < s) {
      cout << "No" << endl;
      return 0;
    }
  }
  cout << "Yes" << endl;
  return 0;
}
