#include <bits/stdc++.h>
using namespace std;
pair<int, int> p[25];
int main() {
  while (true) {
    int n;
    cin >> n;
    if (n == 0) break;
    for (int i = 0; i < n; ++i) cin >> p[i].second >> p[i].first;
    sort(p, p + n);
    long long total = 0;
    for (int i = 0; i < n; ++i) {
      total += p[i].second;
      if (total > p[i].first) {
        cout << "No" << endl;
        break;
      }
      if (i == n - 1) cout << "Yes" << endl;
    }
  }
}
