#include <iostream>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;

#define rep(i,n) for(int i=0;i<n;i++)

int n;
pair<int,int> p[25];

int main(){
	while(cin>>n&&n){
		rep(i,n)cin>>p[i].second>>p[i].first;
		sort(p,p+n);
		int f=1,sum=0;
		rep(i,n){sum+=p[i].second;if(sum>p[i].first)f=0;}
		cout<<(f?"Yes":"No")<<endl;
	}
}