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

using namespace std;

int main(void){
	int n;
	while(cin >> n && n){
		vector<pair<int,int> >v(n);
		bool possible=true;
		int tmp=0;
		for(int i=0;i<n;i++){
			cin >> v[i].second >> v[i].first;
		}
		sort(v.begin(), v.end());
		for(int i=0;i<n;i++){
			tmp += v[i].second;
			if(tmp > v[i].first) possible = false;
		}
		possible?cout<<"Yes"<<endl:cout<<"No"<<endl;
	}
}