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

int main(){
    int n;
    while(cin>>n,n){
        vector<pair<int,int> >vec;
        for(int i=0;i<n;i++){
            int a,b;
            cin>>a>>b;
            vec.push_back(make_pair(b, a));
        }
        sort(vec.begin(),vec.end());
        int all=0;
        bool o=true;
        for(int i=0;i<vec.size();i++){
            all+=vec[i].second;
            if(all>vec[i].first){
                o=false;
                cout<<"No"<<endl;
                break;
            }
        }
        if(o)cout<<"Yes"<<endl;
    }
}