#include <bits/stdc++.h>
using namespace std;
int n;
int x[25];
int c[25];
char z[1 << 25];
int weight(int p) {
  int s = 0;
  for (int i = 0; i < (n); ++i) {
    if (p & (1 << i)) {
      s += x[i];
    }
  }
  return s;
}
bool dfs(int p) {
  if (z[p] != -1) {
    return z[p];
  }
  for (int i = 0; i < (n); ++i) {
    if (p & (1 << i) && weight((1 << n) - (p - (1 << i))) < c[i] &&
        dfs((p - (1 << i)))) {
      return z[p] = 1;
    }
  }
  return z[p] = 0;
}
int main() {
  while (true) {
    scanf("%d", &n);
    if (n == 0) {
      break;
    }
    for (int i = 0; i < (n); ++i) {
      scanf("%d%d", &x[i], &c[i]);
    }
    fill_n(z, 1 << n, -1);
    z[0] = 1;
    printf("%s\n", dfs((1 << n) - 1) ? "Yes" : "No");
  }
  return 0;
}
