#include<iostream>
using namespace std;

#define MAX 30

int main(){
  int bri[MAX],pre[MAX];
  int n;
  int i,j;
  int temp;
  int judge=0,presum=0;

  while(cin >> n){
    judge=0;
    presum=0;
    if(n==0)break;
    for(i=0;i<n;i++){
      cin >> pre[i] >> bri[i];
    }
    //ツ渉ャツつウツつ「ツ渉づ可ソツーツト
    for(i=n-1;i>0;i--){
      for(j=0;j<i;j++){
	if(bri[j]>bri[j+1]){
	  temp = pre[j];
	  pre[j]=pre[j+1];
	  pre[j+1]=temp;
	  temp = bri[j];
	  bri[j] = bri[j+1];
	  bri[j+1] = temp;
	}
      }
    }


    for(i=0;i<n;i++){
      presum += pre[i];
      // cout << bri[i]<<endl;
       if(bri[i]<presum){
	 judge=1;
       }
    }
    
    if(judge==1)cout << "No" << endl;
    else cout << "Yes" << endl;
    
  }


}