#include<iostream>
#include<algorithm>
using namespace std;
pair<int, int>x[100]; int n;
int main() {
	while(true) {
		cin >> n; if (n == 0) { break; }
		for (int i = 0; i < n; i++) {
			cin >> x[i].second >> x[i].first;
		}
		sort(x, x + n);
		int cnt = 0, ok = 0;
		for (int i = 0; i < n; i++) {
			cnt += x[i].second;
			if (cnt > x[i].first) {
				ok = 1;
			}
		}
		if (ok == 1) { cout << "No" << endl; }
		else { cout << "Yes" << endl; }
	}
	return 0;
}