#include <iostream>
#include <utility>
#include <algorithm>
using namespace std;

typedef pair<int, int> pii;

int main()
{
  int n, m, k;
  while(1){
    m = 0;
    k = 0;
    cin >> n;
    if(n == 0){
      break;
    }else{
      int num[n][2];
      pii p[n];
      for(int i = 0; i < n; i++)
	cin >> num[i][0] >> num[i][1];
      for(int i = 0; i < n; i++)
	p[i] = make_pair(num[i][1], num[i][0]);
      sort(p, p + n);
      for(int i = 0; i < n; i++){
	m += p[i].second;
	if(m > p[i].first){
	  cout << "No" << endl;
	  k = i;
	  break;
	}
	if(i == n - 1 && k == 0)
	  k = n - 1;
      }
      if(m <= p[k].first)
	cout << "Yes" << endl;
    }
  }
}