#include <iostream>
#include <algorithm>
#include <map>

using namespace std;

int n;
pair<int, int> p[25];

bool solve(){
  int sum = 0;
  for(int i=0;i<n;i++){
    sum += p[i].second;
    if(sum > p[i].first) return false;
  }
  return true;
}

int main(){
  while(cin >> n && n){
    for(int i=0;i<n;i++){
      cin >> p[i].second >> p[i].first;
    }
    sort(p, p+n);
    cout << (solve() ? "Yes" : "No") << endl;
  }
  return 0;
}