#include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<algorithm>
using namespace std;
struct point{
	int a;
	int b;
}p[30];
bool cmp(const point &q,const point &w){
	return q.b<w.b;
}
int main()
{
	int n,i,sum;
	while(cin>>n&&n){
		for(i=0;i<n;i++)
			scanf("%d%d",&p[i].a,&p[i].b);
		sort(p,p+n,cmp);
		sum=0;int t=1;
		for(i=0;i<n;i++){
			sum+=p[i].a;
			if(sum>p[i].b) {t=0; break;}
		}
		if(t){ printf("Yes\n");}
		else  printf("No\n");
	}

}