#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <cctype>
using namespace std;

#define rep(i,n) for(int (i)=0; (i)<(int)(n); ++(i))
#define foreach(c,i) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
typedef pair<int,int> P;

int N;

int main() {
  while (scanf("%d", &N), N) {
    vector<P> v;
    int weight, bridge;
    rep(i,N) {
      scanf("%d%d",&weight, &bridge);
      v.push_back(P(bridge, weight));
    }
    sort(v.begin(), v.end());
    int cur = 0, ok = 1;
    rep(i,N) {
      cur += v[i].second;
      if (cur > v[i].first) ok = 0;
    }
    printf("%s\n", (ok) ? "Yes" : "No");
  }
  return 0;
}