#include <iostream>
#include <algorithm>

using namespace std;

int main() {
	int n;
	while (cin >> n) {
		if (n == 0) {
			break;
		}
		int data[25][2] = {0};
		for (int i = 0; i < n; i++) {
			cin >> data[i][0] >> data[i][1];
		}
		for (int i = n-1; i > 0; i--) {
			for (int j = 0; j < i; j++) {
				if (data[j][1] > data[j+1][1]) {
					swap(data[j][0], data[j+1][0]);
					swap(data[j][1], data[j+1][1]);
				}
			}
		}
		int counter = 0;
		bool hantei = true;
		for (int i = 0; i < n; i++) {
			if (data[i][1] >= data[i][0]+counter) {
				counter += data[i][0];
			} else {
				hantei = false;
				break;
			}
		}
		if (hantei) {
			cout << "Yes" << endl;
		} else {
			cout << "No" << endl;
		}
	}
	return 0;
}