#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
typedef pair<int, int> P;

void solve()
{
	int n;
	while(cin >> n, n)
	{
		vector<P> input(n);
		for(int i = 0; i < n; ++i)
		{
			cin >> input[i].second >> input[i].first;
		}
		sort(input.begin(), input.end());
		bool flag = true;
		int sum = 0;
		for(int i = 0; i < n; ++i)
		{
			sum += input[i].second;
			if(sum > input[i].first)
			{
				cout << "No" << endl;
				flag = false;
				break;
			}
		}
		if(flag)
		{
			cout << "Yes" << endl;
		}
	}
}

int main()
{
	solve();
	return(0);
}