#include <iostream>
#include <algorithm>
using namespace std;
int n; pair<int, int> d[25];
int main() {
	while (cin >> n, n) {
		for (int i = 0; i < n; i++) cin >> d[i].second >> d[i].first;
		sort(d, d + n);
		int s = 0, f = 0;
		for (int i = 0; i < n; i++) {
			s += d[i].second;
			if (d[i].first < s) {
				f = 1; break;
			}
		}
		cout << (f ? "No" : "Yes") << endl;
	}
	return 0;
}