#include<iostream>
#include<cstdio>
#define N 5000
#define inf 1e18
using namespace std;
int read()
{
    char c=0;
    int sum=0,f=1;
    while (c!='-'&&(c<'0'||c>'9')) c=getchar();
    if (c=='-') c=getchar(),f=-1;
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum*f;
}
void Adder(long long &x,long long d)
{
    x=(x<d)?x:d;
    return;
}
struct reads
{
    long long t,x;
};
reads st[N+1];
int n,pv[N+1];
long long dp[N+1][2];
int main()
{
    n=read();
    for (int i=1;i<=n;++i) st[i].t=read(),st[i].x=read();
    for (int i=1;i<=n;++i)
    {
	if (abs(st[i-1].x-st[i].x)<=st[i].t-st[i-1].t) pv[i]=pv[i-1];
	else pv[i]=i;
    }
    for (int i=0;i<=n;++i) dp[i][0]=dp[i][1]=inf;
    dp[0][0]=0;
    for (int i=1;i<=n;++i)
	for (int j=1;j<=i;++j)
	{
	    if (j==i)
	    {
		if (max(dp[j-1][0]+abs(st[j-1].x-st[i].x),st[j-1].t)<=st[i].t) Adder(dp[i][0],max(dp[j-1][0]+abs(st[j-1].x-st[i].x),st[j-1].t));
		if (max(dp[j-1][1]+abs(st[j-2].x-st[i].x),st[j-1].t)<=st[i].t) Adder(dp[i][0],max(dp[j-2][1]+abs(st[j-2].x-st[i].x),st[j-1].t));
	    }
	    else
	    {
		if (max(dp[j-1][0]+abs(st[j-1].x-st[i].x),st[j-1].t)+abs(st[i].x-st[j].x)<=st[j].t&&j>=pv[i-1]) Adder(dp[i][1],st[i-1].t);
		if (max(dp[j-1][1]+abs(st[j-2].x-st[i].x),st[j-1].t)+abs(st[i].x-st[j].x)<=st[j].t&&j>=pv[i-1]) Adder(dp[i][1],st[i-1].t);
	    }
	}
    puts((dp[n][0]!=inf||dp[n][1]!=inf)?"YES":"NO");
    return 0;
}