#include <cstdio>
#include <vector>
#include <utility>
#include <algorithm>

using namespace std;

int main(){
  int n;
  while(~scanf("%d", &n) && n){
    vector<pair<int, int> > info(n);
    for(int i = 0; i < n; i++){
      scanf("%d %d", &info[i].second, &info[i].first);
    }
    sort(info.begin(), info.end());
    int many = 0;
    for(int i = 0; i < n; i++){
      if(info[i].first < many + info[i].second){
        many = -1;
        break;
      }
      many += info[i].second;
    }
    printf("%s\n", ~many ? "Yes" : "No");
  }
  return 0;
}