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

int main() {
	int n;
	while (cin >> n, n) {
		vector<pair<int, int>> b;
		for (int i = 0; i < n; i++) {
			int v, l;
			cin >> v >> l;
			b.emplace_back(l, v);
		}
		sort(b.begin(), b.end());

		cout << [&b] () {
			int s = 0;
			for (auto& p : b) {
				s += p.second;
				if (s > p.first) {
					return "No";
				}
			}
			return "Yes";
		}() << endl;
	}
	return 0;
}