#include <iostream>
#include <queue>
using namespace std;
typedef pair<int,int> P;

int main(){
	int n;
	priority_queue<P,vector<P>,greater<P> > que;

	while(cin>>n,n){
		int sum=0;
		
		for(int i=0;i<n;i++){
			int tres,bdg;
			cin>>tres>>bdg;
			que.push(P(bdg,tres));
		}
		
		bool flag=false;
		while(que.size()){
			P p=que.top();que.pop();
			sum+=p.second;
			if(sum>p.first){
				cout<<"No"<<endl;
				flag=true;
				break;
			}
		}

		if(!flag) cout<<"Yes"<<endl;
		while(que.size()) que.pop();
	}

	return 0;
}