#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>

typedef std::pair<int, int> P;

P data[30];

int main(){
	int n;

	while (std::cin >> n, n){
		memset(data, 0, sizeof(data));

		for (int i = 0; i < n; i++){
			std::cin >> data[i].second >> data[i].first;
		}

		std::sort(data, data + n);

		int res = 0;
		for (int i = 0; i < n; i++){
			res += data[i].second;
			if (res>data[i].first){
				std::cout << "No" << std::endl;
				break;
			}
			if (i == n - 1)std::cout << "Yes" << std::endl;
		}
	}
	return 0;
}