#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>
#include<random>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    while (cin >> n) {
        if (n==0) break;
        vector<pii> ps(n);
        for (int i = 0; i < n; i++)
            cin >> ps[i].second >> ps[i].first;
        sort(ps.begin(), ps.end());
        auto f = [&]() {
            int now = 0;
            for (int i = 0; i < n; i++) {
                now += ps[i].second;
                if (ps[i].first < now) return false;
            }
            return true;
        };
        if (f()) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
    return 0;
}