#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <stack>
#include <queue>

using namespace std;
typedef long long LL;
typedef pair<int, int> P;
static const double EPS = 1e-5;

#define FOR(i,k,n) for (int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)

int main(void){
  int n;
  while(cin>>n){
    if(n==0)break;
    vector<P> data;
    REP(i,n){
      int a,b;
      cin>>a>>b;
      data.push_back(P(b,a));
    }
    sort(data.begin(),data.end());
    int s=0;
    bool f= false;
    REP(i,data.size()){
      s+=data[i].second;
      if(s>data[i].first){
        f=true;
        break;
      }
    }
    if(f) cout<<"No"<<endl;
    else cout<<"Yes"<<endl;
  }

  return 0;
}