#include <bits/stdc++.h>
int main() {
  int i, j, n, having, a, b, flag = 1, array[25][2];
  while (1) {
    having = 0;
    scanf("%d", &n);
    if (n == 0) {
      break;
    }
    for (i = 0; i < n; i++) {
      scanf("%d %d", &a, &b);
      if (b < a) {
        flag = 0;
      }
      for (j = i; j >= 0; j--) {
        if (j == 0) {
          array[j][0] = a;
          array[j][1] = b;
        }
        if (b == array[j - 1][1]) {
          if (a < array[j - 1][0]) {
            array[j][0] = array[j - 1][0];
            array[j][1] = array[j - 1][1];
            array[j - 1][0] = a;
            array[j - 1][1] = b;
          } else {
            array[j][0] = a;
            array[j][1] = b;
          }
          break;
        } else if (b < array[j - 1][1]) {
          array[j][0] = array[j - 1][0];
          array[j][1] = array[j - 1][1];
        } else {
          array[j][0] = a;
          array[j][1] = b;
          break;
        }
      }
    }
    for (i = 0; i < n; i++) {
      having += array[i][0];
      if (array[i][1] < having) {
        flag = 0;
        break;
      }
    }
    if (flag) {
      printf("Yes\n");
    } else {
      printf("No\n");
    }
  }
  return 0;
}
