#include <bits/stdc++.h>
using namespace std;
bool dp[1 << 25];
int main() {
  int n;
  while (cin >> n, n) {
    int a[25], b[25];
    for (int i = 0; i < 1 << n; i++) dp[i] = false;
    dp[0] = true;
    for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
    for (int i = 1; i < 1 << n; i++) {
      int sum = 0;
      for (int j = 0; j < n; j++)
        if (i >> j & 1) sum += a[j];
      for (int j = 0; j < n; j++)
        if (i >> j & 1 && dp[i & ~(1 << j)] && b[j] >= sum) dp[i] = true;
    }
    if (dp[(1 << n) - 1])
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  }
  return 0;
}
