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

typedef pair<int,int> P;

int main(){
	int n;
	while(cin >> n,n){
		vector<P> vec;
		for(int i = 0;i < n;i++){
			int a,b;
			cin >> a >> b;
			vec.push_back(P(b,a));
		}
		sort(vec.begin(),vec.end());
		bool flag = true;
		int now = 0;
		for(int i = 0;i < n;i++){
			now += vec[i].second;
			if(now > vec[i].first) flag = false;
		}
		if(flag) cout << "Yes" << endl;
		else cout << "No" << endl;
	}
	return 0;
}