#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
LABEL:
  while (cin >> n, n) {
    vector<pair<int, int>> island(n);
    int max = 0;
    int a, b;
    for (int i = 0; i < n; i++) {
      cin >> a >> b;
      island[i] = make_pair(b, a);
      max += a;
    }
    sort(island.begin(), island.end());
    int i;
    for (i = n - 1; i >= 0; i--) {
      if (island[i].first < max) {
        cout << "No" << endl;
        goto LABEL;
      }
      max -= island[i].second;
    }
    cout << "Yes" << endl;
  }
  return 0;
}
