#include<iostream>
#include<map>
#include<functional>
#include<algorithm>
using namespace std;
struct P{
	int a,b;
};
bool cpm(const P &s,const P &t){
	return s.b<t.b;
}
int main(){
	int n,sum,x,y;
	while(cin>>n,n){
		P box[100];
		for(int i=0;i<n;i++){
			cin>>x>>y;
			box[i].a=x;
			box[i].b=y;
		}
		sort(box,box+n,cpm);
		sum=0;
		int i;
		
		for(i=0;i<n;i++){
			sum+=box[i].a;
			if(sum>box[i].b)
			break;
		}
		if(i==n)
		cout<<"Yes"<<endl;
		else
		cout<<"No"<<endl;
	}
	return 0;
}