#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
#define DEBUGP(val) cerr << #val << "=" << val << "\n"

using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PI;
const ll mod = 1e9 + 7;



int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  while (cin >> n && n) {
    vector<PI> a(n);
    REP(i, 0, n) {
      int x, y;
      cin >> x >> y;
      a[i] = PI(y, x);
    }
    sort(a.begin(), a.end());
    int tot = 0;
    bool ok = 1;
    REP(i, 0, n) {
      tot += a[i].second;
      if (tot > a[i].first) {
        ok = 0;
        break;
      }
    }
    cout << (ok ? "Yes" : "No") << endl;
  }
}

