//#define LOCAL

#include <fstream>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>

#define rep(i,n) for(int i=0; i<n; i++)

using namespace std;



int main()
{
#ifdef LOCAL
    ifstream in("input.txt");
    cin.rdbuf(in.rdbuf());
#endif

    int n;
    typedef pair<int, int> P;
    P mx_w[30];

    while (true) {
        cin >> n;
        if (n == 0) break;

        rep(i,n) {
            int w, mx;
            cin >> w >> mx;
            mx_w[i] = P(mx, w);
        }

        sort(mx_w, mx_w + n);

        int now_w = 0;
        bool ans = true;
        rep(i,n) {
            now_w += mx_w[i].second;
            if (now_w > mx_w[i].first) {
                ans = false;
                break;
            }
        }

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