
#include <iostream>
#include <vector>
#include<algorithm>
#include <string>

using namespace std;

int main(){

    int n;
    cin >> n;
    cin.ignore();
    int hoge=0;
    int count = 0;
    vector<string> out;
    while(n!=0){
        int hoge=0;
        vector< pair<int,int> > island(n);
        pair<int,int> row;

        for(int i=0;i<n;i++){
            int t,w;
            cin >> t >> w;
            cin.ignore();
            row.first = w;
            row.second = t;
            island[hoge] = row;
            hoge ++;
        }

        sort(island.begin(),island.end());

        int total = 0;
        int flag = 0;
        for(int i=0;i<n;i++){
            total += island[i].second;

            if(total > island[i].first){
                flag = 1;
                break;
            }
        }
        if(flag == 0){
            out.push_back("Yes");
        }else{
            out.push_back("No");
        }
        count ++;

        cin >> n;
        cin.ignore();

    }

    for(int i=0;i<count;i++){
        cout << out[i] << endl;
    }

    return 0;
}