#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>

using namespace std;

int main() {
    int n;
    while (cin >> n, n != 0) {
        vector< pair<int, int> > island(n);
        for (int i = 0; i < n; i++) {
            cin >> island[i].second >> island[i].first;
        }
        sort(island.begin(), island.end());
        
        int w = 0;
        string ans = "Yes";
        for (int i = 0; i < island.size(); i++) {
            w += island[i].second;
            if (w > island[i].first) {
                ans = "No";
                break;
            }
        }
        cout << ans << endl;
    }
    return 0;
}