#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b) - 1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)

#define PB push_back
#define MP make_pair
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define CLR(a) memset(a,0,sizeof(a))
#define SET(a,c) memset(a,c,sizeof(a))
#define DEBUG(x) cout<<"#x"<<": "<<x<<endl

using namespace std;

typedef long long int ll;
typedef vector<int> vi;
typedef vector<ll> vl;

const ll INF = INT_MAX/3;
const ll MOD = 1000000007;
const double EPS = 1e-14;
const int dx[] = {1,0,-1,0} , dy[] = {0,1,0,-1};

int main(){
    while(true){
	int n;
	cin >> n;
	if(n==0) break;
	vector< pair<ll,ll> > v;
	REP(i,n){
	    pair<ll,ll> temp;
	    cin >> temp.second >> temp.first;
	    v.PB(temp);
	}
	sort(ALL(v));
	ll sum = 0;
	bool flg = true;
	REP(i,n){
	    sum += v[i].second;
	    if(sum > v[i].first){
		flg = false;
		break;
	    }
	}
	if(flg)
	    cout << "Yes" << endl;
	else
	    cout << "No" << endl;
    }

    return 0;
}