#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
 
#define rep(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define all(v) (v).begin(), (v).end()
#define rev(s) (s).rbegin(), (s).rend()
#define MP make_pair
#define X first
#define Y second
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;

void fin(){
	freopen("test.txt", "r", stdin);
}

int main(){
	int n;
	while(cin >> n, n){
		vector<P> v;
		rep(i, n){
			int w, lim;
			cin >> w >> lim;
			v.push_back(MP(lim, w));
		}
		sort(all(v));
		int sum = 0;
		bool ok = true;
		rep(i, v.size()){
			sum += v[i].second;
			if(sum > v[i].first){
				ok = false;
				break;
			}
		}
		cout << (ok?"Yes":"No") << endl;
	}

	return 0;
}