#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
double EPS = 1e-10;
bool used[30];
long long d[30], w[30];
int n;
int main() {
  long long sum;
  bool f;
  while (cin >> n && n) {
    for (int i = (0); i < (int)(n); i++) cin >> d[i] >> w[i], used[i] = false;
    sum = 0LL;
    for (int i = (0); i < (int)(n); i++) sum += d[i];
    f = true;
    for (int i = 0; i < n; i++) {
      int idx = -1;
      for (int j = 0; j < n; j++) {
        if (!used[j]) {
          if (w[j] >= sum) {
            if (idx == -1)
              idx = j;
            else if (d[idx] < d[j])
              idx = j;
          }
        }
      }
      if (idx == -1) {
        f = false;
        break;
      }
      sum -= d[idx];
    }
    cout << (f ? "Yes" : "No") << endl;
  }
}
