#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
using namespace std;
#define P pair<int,int>
#define rep(i,n) for(int i = 0;i<n;i++)
#define pb(n) push_back(n)

int n;
int main() {
	while(true){
		cin >> n;
		if(n == 0) break;
		vector<P> V;
		rep(i,n){
			int d,w;
			cin >> w >> d;
			V.push_back(P(d,w));
		}
		sort(V.begin(),V.end());
		int sw = 0;
		bool ans = true;
		rep(i,n){
			sw += V[i].second;
			if(sw > V[i].first){
				ans = false;
				break;
			}
		}
		cout << (ans ? "Yes" : "No") << endl;
	}
	return 0;
}