#include<iostream>
#include<algorithm>

using namespace std;
typedef pair<int,int> P;
const int MAX = 25;
P data[MAX+1];
int in;

bool solve(){
  sort(data,data+in);
  int sum = 0;
  for(int i = 0; i < in; i++){
    sum += data[i].second;
    if(sum > data[i].first) return false;
  }
  return true;
}
int main(){

  while(cin >> in && in){
    for(int i = 0; i < in; i++) cin >> data[i].second >> data[i].first;
    if(solve()) cout << "Yes" << endl;
    else cout << "No" << endl;
  }
  return 0;
}