#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;

int main(void){
  while(true){
    int n;
    cin >> n;
    if(n == 0){ break; }

    int t, b;
    vector<pair<int, int> > oldbridges;
    for(int i = 0; i < n; i++){
      cin >> t >> b;
      oldbridges.push_back(make_pair(b, t));
    }

    sort(oldbridges.begin(), oldbridges.end());

    int sum = 0;
    bool flag = true;
    for(int i = 0; flag && i < n; i++){
      sum += oldbridges[i].second;
      flag = (sum <= oldbridges[i].first);
    }

    if(flag){ cout << "Yes" << endl; }
    else{ cout << "No" << endl; }
  }

  return 0;
}

