#include <bits/stdc++.h>
using namespace std;

#define for_(i,a,b) for(int i=(a);i<(b);++i)

int n, a[25], b[25];

void solve() {
	vector< int > order;
	for_(i,0,n) order.push_back(i);
	
	sort(order.begin(), order.end(), [&](int i, int j) {
		return b[i] == b[j] ? a[i] < a[j] : b[i] < b[j];
	});
	
	int cur = 0;
	bool flag = true;
	
	for_(ii,0,n) {
		int i = order[ii];
		flag &= (cur <= b[i]);
		cur += a[i];
		flag &= (cur <= b[i]);
	}
	
	cout << (flag ? "Yes" : "No") << endl;
}

int main() {
	while (cin >> n, n) {
		for_(i,0,n) cin >> a[i] >> b[i];
		solve();
	}
}