#include <cstdio>
#include <algorithm>

#define rep(i, n) for(int i = 0; i < (n); ++i)

using namespace std;

typedef pair<int, int> P;

int n;
P x[25];

int main(){
	while(true){
		scanf("%d", &n);
		if(n == 0){
			break;
		}
		rep(i, n){
			int a, b;
			scanf("%d%d", &a, &b);
			x[i] = P(b, a);
		}
		sort(x, x + n);
		int w = 0;
		bool ans = true;
		rep(i, n){
			w += x[i].second;
			if(w > x[i].first){
				ans = false;
				break;
			}
		}
		printf("%s\n", ans ? "Yes" : "No");
	}
	return 0;
}