#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, num1, num2, V;
  vector<pair<int, int>> treasure(25);
  bool judge;
  while (cin >> n, n) {
    judge = true;
    V = 0;
    for (int i = 0; i < n; i++) {
      cin >> num1 >> num2;
      treasure[i] = make_pair(num2, num1);
    }
    sort(treasure.begin(), treasure.begin() + n);
    for (int i = 0; i < n; i++) {
      V += treasure[i].second;
      if (V > treasure[i].first) {
        judge = false;
        break;
      }
    }
    if (judge == true) {
      cout << "Yes" << endl;
    } else {
      cout << "No" << endl;
    }
    for (int i = 0; i < n; i++) {
      treasure[i] = make_pair(0, 0);
    }
  }
  return 0;
}
