#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  while (cin >> n && n) {
    vector<pair<long long, long long> > t(n);
    int i;
    for (i = 0; i < n; ++i) {
      long long a, b;
      cin >> a >> b;
      t[i].first = a;
      t[i].second = b;
    }
    sort(t.begin(), t.end());
    long long sum = 0;
    for (i = 0; i < n; ++i) {
      sum += t[i].first;
      if (sum > t[i].second) {
        break;
      }
    }
    if (i == n) {
      cout << "Yes" << endl;
    } else {
      cout << "No" << endl;
    }
  }
  return 0;
}
