#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>

#define rep(i, j) FOR(i, 0, j)
#define FOR(i, j, k) for(int i = j; i < k; ++i)

using namespace std;

int main(){
  int n, value, f;
  while(scanf("%d", &n) && n){
    vector<pair<int, int> >v(n);
    rep(i, n){
      scanf("%d%d", &value, &f);
      v[i] = make_pair(f, value);
    }

    sort(v.begin(), v.end());
    int sum = 0, f = 0;
    rep(i, n){
      sum += v[i].second;
      if(sum > v[i].first) f = 1;
    }

    if(f) puts("No");
    else puts("Yes");
  }
  return 0;
}