#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)

int cmp(pair<int,int> a,pair<int,int> b){
	return a.second < b.second;
}

int main(){
	int n,a,b,now;
	while(cin >> n && n){
		bool flag = false;
		vector<pair<int,int> > p;
		rep(i,n){
			cin >> a >> b;
			p.push_back(make_pair(a,b));
		}
		sort(p.begin(),p.end(),cmp);
		now = 0;
		rep(i,n){
			now += p[i].first;
			//cout << p[i].first << " " << p[i].second << " b(" << now-p[i].first << ")" << " a(" << now << ")" << endl;
			if(now>p[i].second)flag = true;
		}
		if(!flag)cout << "Yes" << endl;
		else cout << "No" << endl;
	}
}