#include <bits/stdc++.h>
std::pair<int, int> data[30];
int main() {
  int n;
  while (std::cin >> n, n) {
    memset(data, 0, sizeof(data));
    for (int i = 0; i < n; i++) {
      std::cin >> data[i].first >> data[i].second;
    }
    std::sort(data, data + n);
    int res = 0;
    for (int i = 0; i < n; i++) {
      res += data[i].first;
      if (res > data[i].second) {
        std::cout << "No" << std::endl;
        break;
      }
      if (i == n - 1) std::cout << "Yes" << std::endl;
    }
  }
  return 0;
}
