#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, int> P3;
const ll MOD = ll(1e9)+7;
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(1e5 + 5);
const double EPS = 1e-11;
const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define SORT(v) sort((v).begin(), (v).end())
#define ALL(v) (v).begin(), (v).end()

int main() {
    ll n;
    while(cin >> n, n){
        vector<P> v;
        REP(i,n){
            ll a, b;
            cin >> a >> b;
            v.push_back({b,a});
        }
        SORT(v);
        string ans = "Yes";
        ll sum = 0;
        for(auto p : v){
            sum += p.second;
            if(sum > p.first){
                ans = "No";
                break;
            }
        }
        cout << ans << endl;
    }
    return 0;
}

