#include<iostream>
#include<algorithm>
using namespace std;
typedef pair<int, int> p;
int main() {
	int n;
	while (cin >> n, n) {
		p a[30];
		int sum = 0;
		for (int i = 0; i < n; i++) {
			cin >> a[i].second >> a[i].first;
			sum += a[i].second;
		}
		sort(a, a + n);
		for (int i = n - 1; i >= 0; i--) {
			if (sum <= a[i].first) {
				sum -= a[i].second;
			}
			else{
				cout << "No\n";
				goto heaven;
			}
		}
		cout << "Yes\n";
		heaven:;
	}
}
