#include <bits/stdc++.h>
using namespace std;
#define int long long   // <-----!!!!!!!!!!!!!!!!!!!

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()

typedef long long ll;
typedef pair<int, int> P;

bool check(int n) {
    vector<P> v;
    rep(i, n) {
        int a, b;
        cin >> a >> b;
        v.emplace_back(P(b, a));
    }
    sort(all(v));
    int sm = 0;
    for (auto p : v) {
        int a, b;
        tie(b, a) = p;
        sm += a;
        if (sm > b) {
            return false;
        }
    }
    return true;
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    int n;
    while (cin >> n, n) {
        cout << (check(n) ? "Yes" : "No") << endl;
    }

}