def solve(l):
	have = 0
	for m, w in l:
		have += w
		if m < have:
			return "No"
	return "Yes"
while True:
	n = input()
	if n == 0: break
	l = [tuple(reversed(map(int, raw_input().split()))) for i in xrange(n)]
	l.sort()
	print solve(l)