#include "bits/stdc++.h"
using namespace std;

//#define int long long
#define DBG 1
#define dump(o) if(DBG){cerr<<#o<<" "<<(o)<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9 + 7);

signed main() {
	for (int n; cin >> n&&n;) {
		vector<pair<int, int>> v(n);
		rep(i, 0, n) {
			cin >> v[i].second >> v[i].first;
		}
		sort(all(v));
		int cur = 0;
		bool flag = true;
		rep(i, 0, n) {
			cur += v[i].second;
			if (cur > v[i].first) {
				flag = false;
				break;
			}
		}
		if(flag)cout << "Yes" << endl;
		else cout << "No" << endl;
	}
	return 0;
}