#include<iostream>
#include<utility>
#include<algorithm>
using namespace std;

typedef pair<int, int> P;

int main() {
	int n;
	while (cin >> n, n) {
		P t[25];
		for (int i = 0;i < n;i++) {
			cin >> t[i].second >> t[i].first;
		}
		sort(t, t + n);
		int w = 0;
		int flg = 1;
		for (int i = 0;i < n;i++) {
			w += t[i].second;
			if (t[i].first < w) {
				flg = 0;
				break;
			}
		}

		if (flg == 1)cout << "Yes" << endl;
		else cout << "No" << endl;
	}
	return 0;
}