#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  pair<int, int> pairs[25];
  while (true) {
    int total = 0;
    bool is_possible = true;
    cin >> n;
    if (n == 0) {
      return 0;
    }
    for (int i = 0; i < n; ++i) {
      cin >> pairs[i].second >> pairs[i].first;
      pairs[i].first -= pairs[i].second;
    }
    sort(pairs, pairs + n);
    for (int i = 0; i < n; ++i) {
      if (pairs[i].first < total) {
        is_possible = false;
        break;
      }
      total += pairs[i].second;
    }
    if (is_possible) {
      cout << "Yes" << endl;
    } else {
      cout << "No" << endl;
    }
  }
}
