#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
  int n;
  int bridge, tresure;
  bool flag;
  while(cin >> n, n) {
    flag = false;
    pair<int, int> p[26];
    for(int i = 0 ; i < n ; i++) {
      cin >> tresure >> bridge;
      p[i] = make_pair(bridge, tresure);
    }
    sort(p, p+n); // first ツ優ツ静ヲツづortツつウツづェツづゥ
    
    int sum=0, i;
    for(i = 0 ; i < n ; i++) {
      if(sum > p[i].first || sum + p[i].second > p[i].first) break;
      sum += p[i].second;
    }
    
    if(i == n) flag = true; //ツ催古」ツづ慊づδ仰ーツプツ出ツ猟按つスツづァ YES
    else flag = false;      //ツ途ツ陳づ終ツづュツづつスツづァ NO
    
    if(flag == true) cout << "Yes" << endl;
    else cout << "No" << endl;
  }
  return 0;
}