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


int main(){

   typedef pair<int, int> P;
   int N,num;
   int word;
   P p;
   while(1){
     int sum=0,flag=0;
     vector<P> v;
     cin>>N;
     if(N==0) break;
     for(int i=0;i<N;i++){
       cin>>word>>num;
       p.first=num;
       p.second=word;
       v.push_back(p);
     }
     sort(v.begin(),v.end());
     for(int i=0;i<N;i++){
       sum+=v[i].second;
       if(v[i].first<sum){
	 flag=1;
       }
     }
     if(flag) cout<<"No"<<endl;
     else cout<<"Yes"<<endl;
   }
   return 0;
}