#include <stdio.h>

void bsort(int a[],int b[],int lim)
{
	int temp = 0;
	int n;
	int m;


	for( n = 0 ; n < lim - 1 ; n++){
		for( m = 0 ; m < lim - 1 - n ; m++){

		if(a[m] > a[m+1])
		{
			temp = a[m+1];
			a[m+1] = a[m];
			a[m] = temp;
			temp = b[m+1];
			b[m+1] = b[m];
			b[m] = temp;
		}
		}

	}
}
			



int main(void)
{
	int n = 1;
	int tr[25] = {0};
	int br[25] = {0};
	
	int i;

	int gettr = 0;
	
	int out[10000] = {0};
	int round = 0;

	while(n){

		scanf("%d",&n);

		for( i = 0 ; i < n ; i++){
			scanf("%d",&tr[i]);
			scanf("%d",&br[i]);
		}

		bsort(br, tr, n);

		for( i = 0 ; i < n ; i++){
			gettr += tr[i];
			
			if( gettr > br[i]){
				out[round] = 2;
				break;
			}
		}

		if(out[round] != 2)
		out[round] = 1;

		round++;
		gettr = 0;
		
	}

	

	for(i = 0; i < round - 1 ; i++ )
	{
		if(out[i] == 1)
			puts("Yes");
		else
			puts("No");
	}

	return 0;
}