#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  while (cin >> n) {
    if (n == 0) break;
    int tb[25][2];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < 2; j++) {
        cin >> tb[i][j];
      }
    }
    int max = tb[0][1];
    int min = tb[0][1];
    for (int i = 1; i < n; i++) {
      if (max < tb[i][1]) {
        max = tb[i][1];
      }
      if (min > tb[i][1]) {
        min = tb[i][1];
      }
    }
    int newtb[25][2];
    int s = 0;
    for (int i = min; i <= max; i++) {
      for (int j = 0; j < n; j++) {
        if (i == tb[j][1]) {
          newtb[s][1] = tb[j][1];
          newtb[s][0] = tb[j][0];
          s += 1;
        }
      }
    }
    int alltreasure = 0;
    int land = 0;
    while (land < n) {
      alltreasure += newtb[land][0];
      if (newtb[land][1] >= alltreasure) {
        land += 1;
      } else {
        cout << "NO" << endl;
        break;
      }
      if (land == n - 1) {
        cout << "Yes" << endl;
        break;
      }
    }
  }
  return 0;
}
