#include <bits/stdc++.h>
using namespace std;
pair<int, int> a[222];
int main() {
  int i, j, k, n;
  while (scanf("%d", &n) != EOF, n) {
    int b = 0;
    for (i = 0; i < n; i++) {
      scanf("%d%d", &a[i].second, &a[i].first);
    }
    sort(a, a + n);
    for (i = 0; i < n; i++) {
      b += a[i].second;
      if (a[i].first < b) break;
    }
    puts(i == n ? "Yes" : "No");
  }
  return 0;
}
