#include<vector>
#include<list>
#include<map>
#include<set>
#include<deque>
#include<queue>
#include<stack>
#include<bitset>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<iostream>
#include<sstream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<string>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<climits>
#include<complex>
#define sz(x) (int)((x).size())
#define rep(i,n) for (int i=0;i<n;i++)
#define mp make_pair
#define pb push_back
#define all(x) x.begin(),x.end()
#define clr(x) memset((x),0,sizeof(x))
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vpi;
pair<int,int>a[222];
int main()
{
	int i,j,k,n;
	while (scanf("%d",&n)!=EOF,n)
	{
		int b=0;
		for (i=0;i<n;i++)
		{
			scanf("%d%d",&a[i].second,&a[i].first);
		}
		sort(a,a+n);
		for (i=0;i<n;i++)
		{
			b+=a[i].second;
			if (a[i].first<b)break;
		}
		puts(i==n?"Yes":"No");			
	}
	return 0;
}
		
		
		