#include <iostream>
#include <utility>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)

pair<int, int> p[25];
int main() {
	while (true) {
		int n;
		cin >> n;
		if (n == 0) break;
		REP(i, n) cin >> p[i].second >> p[i].first;
		sort(p, p + n);

		long long total = 0;
		REP(i, n) {
			total += p[i].second;
			if (total > p[i].first) {
				cout << "No" << endl;
				break;
			}
			if (i == n - 1) cout << "Yes" << endl;
		}
	}
}