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

int n;

bool solve() {
	vector<pair<int, int> > b;
	for (int i = 0; i < n; i++) {
		int v, l;
		cin >> v >> l;
		b.push_back(make_pair(l, v));
	}
	sort(b.begin(), b.end());
	
	int s = 0;
	for (int i = 0; i < n; i++) {
		s += b[i].second;
		if (s > b[i].first) {
			return false;
		}
	}
	return true;
}

int main() {
	while (cin >> n, n) {
		if (solve()) cout << "Yes" << endl;
		else cout << "No" << endl;
	}
	return 0;
}