#include <iostream>
#include <map>
#include <algorithm>

using namespace std;

typedef pair<int, int> P;

bool comp(const P &f, const P &s) {
    return (f.first < s.first) || ((f.first == s.first) && (f.second < s.second));
}

int main()
{
    int n;

    while (cin >> n, n) {
        P m[25];
        bool flag = true;
        int amount = 0;

        for (int i = 0; i < n; i++) 
            cin >> m[i].second >> m[i].first;

        sort(m, m + n, comp);

        for (int i = 0; i < n; i++) {
            amount += m[i].second;

            if (amount > m[i].first) {
                flag = false;
                break;
            }
        }

        if (flag)
            cout << "Yes" << endl;
        else
            cout << "No" << endl;
    }

    return 0;
}