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