#include <iostream>
#include <cstdio>
#include <algorithm>
#include <array>
#include <vector>

using namespace std;

int main() {
  while( true ) {
    int n;
    cin >> n;
    if ( n == 0 ) break;
    vector<pair<int, int>> vs(n);
    for ( int i = 0; i < n; i++ ) {
      int q, c;
      cin >> q >> c;
      vs[ i ] = make_pair( c, q );
    }
    sort( vs.begin(), vs.end() );
    int sum = 0;
    bool success = true;
    for ( auto p : vs ) {
      sum += p.second;
      if ( sum > p.first ) {
	success = false;
	break;
      } 
    }
    cout << ( success ? "Yes" : "No" ) << endl;
  }  
}