#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()

#define PI acos(-1.0)
#define INF 10000000

typedef long long ll;

int n, a, b, c = 0;
vector< pair<int, int> > vpi;
bool f = 0;

int main() {
	while (cin >> n){
		if (!n)break;
		REP(i, n){
			cin >> b >> a;
			pair<int, int> pi;
			pi.first = a;
			pi.second = b;
			vpi.push_back(pi);
		}
		sort(ALL(vpi));
		REP(i, n){
			c += vpi[i].second;
			if (c > vpi[i].first){
				f = 1;
			}
		}
		f ? cout << "No\n" : cout << "Yes\n";
		c = 0;
		f = 0;
		vpi.clear();
	}
}