#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  cin.ignore();
  int hoge = 0;
  int count = 0;
  vector<string> out;
  while (n != 0) {
    int hoge = 0;
    vector<pair<int, int> > island(n);
    pair<int, int> row;
    for (int i = 0; i < n; i++) {
      int t, w;
      cin >> t >> w;
      cin.ignore();
      row.first = t;
      row.second = w;
      island[hoge] = row;
      hoge++;
    }
    sort(island.begin(), island.end());
    int total = 0;
    int flag = 0;
    for (int i = 0; i < n; i++) {
      total += island[i].first;
      if (total > island[i].second) {
        flag = 1;
        break;
      }
    }
    if (flag == 0) {
      out.push_back("Yes");
    } else {
      out.push_back("No");
    }
    count++;
    cin >> n;
    cin.ignore();
  }
  for (int i = 0; i < count; i++) {
    cout << out[i] << endl;
  }
  return 0;
}
