#include <bits/stdc++.h>
using namespace std;
int dfs(int n, int m[2][25], int a[25], int N, int count) {
  if (N == n) {
    return 1;
  }
  for (int i = 0; i < n; i++) {
    if (a[i] == 0) {
      if (count + m[0][i] > m[1][i]) {
        break;
      }
      a[i] = 1;
      if (dfs(n, m, a, N + 1, count + m[0][i]) == 1) {
        return 1;
      } else {
        a[i] = 0;
      }
    }
  }
  return 0;
}
int main() {
  int n;
  int m[2][25];
  while (1) {
    cin >> n;
    if (n == 0) {
      break;
    }
    for (int i = 0; i < n; i++) {
      cin >> m[0][i] >> m[1][i];
    }
    int a[25] = {0};
    if (dfs(n, m, a, 0, 0) == 1) {
      cout << "Yes" << endl;
    } else {
      cout << "No" << endl;
    }
  }
  return 0;
}
