#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, k;
  while (1) {
    m = 0;
    k = 0;
    cin >> n;
    if (n == 0) {
      break;
    } else {
      int num[n][2];
      pair<int, int> p[n];
      for (int i = 0; i < n; i++) cin >> num[i][0] >> num[i][1];
      for (int i = 0; i < n; i++) p[i] = make_pair(num[i][1], num[i][0]);
      sort(p, p + n);
      for (int i = 0; i < n; i++) {
        m += p[i].second;
        if (m > p[i].first) {
          cout << "No" << endl;
          break;
          k = i;
        }
      }
      if (m < p[k].first) cout << "Yes" << endl;
    }
  }
}
