#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];
short ps[N+1][N+1],ps2[N+1][N+1];
int n,lst[N+1];
long long dp[N+1][2];
bool used[N+1][N+1];
int main()
{
    bool op;
    int nw,nw2;
    n=read();
    for (int i=1;i<=n;++i) st[i].t=read(),st[i].x=read();
    for (int i=0;i<=n;++i) dp[i][0]=dp[i][1]=inf;
    dp[0][0]=0;
    for (int i=n;i>=1;--i)
    {
	nw=nw2=0,op=1;
	for (int j=i;j>=1;--j)
	{
	    if (st[j].x!=st[i].x)
	    {
		if (!lst[i]) lst[i]=j;
		if (nw) op&=(abs(st[nw].x-st[j].x)<=st[nw].t-st[j].t);
	        nw=j;
	    }
	    else nw2=j;
	    used[j][i]=op,ps[j][i]=nw,ps2[j][i]=nw2;
	}
    }
    for (int i=1;i<=n;++i)
    {
	for (int j=lst[i]+1;j<=lst[i]+1;++j)
	{
	    if (dp[j-1][0]+abs(st[j-1].x-st[i].x)<=st[j].t) Adder(dp[i][0],max(dp[j-1][0]+abs(st[j-1].x-st[i].x),st[j-1].t));
	    if (dp[j-1][1]+abs(st[lst[j-1]].x-st[i].x)<=st[j].t) Adder(dp[i][0],max(dp[j-1][1]+abs(st[lst[j-1]].x-st[i].x),st[j-1].t));
	}
	for (int j=1;j<=lst[i];++j)
	{
	    if (dp[j-1][0]+abs(st[j-1].x-st[i].x)<=st[ps2[j][i]].t&&max(dp[j-1][0]+abs(st[j-1].x-st[i].x),st[j-1].t)+abs(st[i].x-st[ps[j][i]].x)<=st[ps[j][i]].t&&used[j][i]) Adder(dp[i][1],st[lst[i]].t);
	    if (dp[j-1][1]+abs(st[lst[j-1]].x-st[i].x)<=st[ps2[j][i]].t&&max(dp[j-1][1]+abs(st[lst[j-1]].x-st[i].x),st[j-1].t)+abs(st[i].x-st[ps[j][i]].x)<=st[ps[j][i]].t&&used[j][i]) Adder(dp[i][1],st[lst[i]].t);
	}
    }
    puts((dp[n][0]!=inf||dp[n][1]!=inf)?"YES":"NO");
    return 0;
}