#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;

int main()
{
	int n;
	while (cin >> n, n){
		priority_queue<P, vector<P>, greater<P> > pq;
		while (n--){
			int a, b;
			cin >> a >> b;
			pq.push(P(b, a));
		}
		
		bool res = true;
		int sum = 0;
		for (; pq.size(); pq.pop()){
			P p = pq.top();
			sum += p.second;
			if (sum > p.first){
				res = false;
				break;
			}
		}
		
		if (res) cout << "Yes" << endl;
		else cout << "No" << endl;
	}
	
	return 0;
}