// AOJ1052_OldBridges.cpp

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main(){
	int n;
	while(cin >> n, n){
		vector< pair<int, int> > vp;
		for(int i=0;i<n;i++){
			int a, b; cin >> a >> b;
			vp.push_back(make_pair(b,a));
		}
		sort(vp.begin(), vp.end());
		bool ok = true;
		int sum = 0;
		for(int i=0;i<n;i++){
			sum += vp[i].second;
			if(sum > vp[i].first) ok = false;
		}
		cout << (ok ? "Yes" : "No") << endl;
	}
}