#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <iostream>
typedef long long int ll;
#define BIG_NUM 2000000000
#define MOD 1000000007
using namespace std;

struct Info{
	Info(int arg_item,int arg_bridge){
		item = arg_item;
		bridge = arg_bridge;
	}
	bool operator<(const struct Info &arg) const{
			return bridge > arg.bridge;
	};

	int item,bridge;
};

void func(int N){

	int left,right;

	priority_queue<Info> Q;

	for(int i = 0; i < N; i++){
		scanf("%d %d",&left,&right);
		Q.push(Info(left,right));
	}

	int sum = 0;

	bool FLG = true;

	while(!Q.empty()){

		sum += Q.top().item;
		if(sum > Q.top().bridge){
			FLG = false;
			break;
		}
		Q.pop();
	}

	if(FLG){
		printf("Yes\n");
	}else{
		printf("No\n");
	}

}

int main(){

	int N;
	while(true){
		scanf("%d",&N);
		if(N == 0)break;

		func(N);
	}

	return 0;
}