#include<iostream>
#include<algorithm>
using namespace std;
typedef pair<int,int> P;
int n;
P t[25];
bool solve(){
  int sum=0;
  for(int i=0;i<n;i++){
    sum+=t[i].second;
    if(sum>t[i].first)return false;
  }
  return true;
}
int main(){
  while(cin>>n&&n){
    for(int i=0;i<n;i++)cin>>t[i].second>>t[i].first;
    sort(t,t+n);
    cout<<(solve()?"Yes":"No")<<endl;
  }
  return 0;
}