#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, wg, br, sum, yorn;
  vector<pair<int, int>> root;
  while (1) {
    sum = 0;
    yorn = 0;
    cin >> n;
    if (n == 0) {
      break;
    }
    for (int i = 0; i < n; ++i) {
      cin >> wg >> br;
      root.push_back(make_pair(wg, br));
    }
    sort(root.begin(), root.end());
    for (int i = 0; i < n; ++i) {
      pair<int, int> p = root[i];
      if (sum > p.second) {
        yorn = 1;
      }
      sum += p.first;
      if (sum > p.second) {
        yorn = 1;
      }
    }
    if (yorn == 1) {
      cout << "No" << endl;
    } else {
      cout << "Yes" << endl;
    }
  }
  return 0;
}
