#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e6+5,inf=1.5e9;
struct node{
	int t,x;
}p[N];
struct qj{
	int l,r;
	friend qj operator+(qj a,qj b){
		if(a.l>a.r)return b;
		if(b.l>b.r)return a;
		return {min(a.l,b.l),max(a.r,b.r)};
	}
}f[N][2];
int n,lst[N],qz[N];
map<int,int>q;
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++)cin>>p[i].t>>p[i].x,f[i][0]=f[i][1]={inf,-inf};
	for(int i=1;i<=n;i++){
		lst[i]=q[p[i].x];
		q[p[i].x]=i;
		qz[i]=qz[i-1]+(p[i].t-p[i-1].t<abs(p[i].x-p[i-1].x));
	}
	for(int i=1;i<=n;i++){
		int t=p[i].t-p[i-1].t,lth=t-abs(p[i].x-p[i-1].x);
		if(lth>=0){
			lth>>=1;
			if(f[i-1][0].l<=f[i-1][0].r)f[i][0]=(qj){min(p[i].x,p[i-1].x)-lth,max(p[i].x,p[i-1].x)+lth}+f[i-1][0];
		}
		if(f[i-1][1].l<=f[i-1][1].r){
			int l=f[i-1][1].l,r=f[i-1][1].r;
			if(p[i].x<l){
				if(l-p[i].x<=t){
					lth=t-(l-p[i].x)>>1;
					f[i][0]=f[i][0]+(qj){p[i].x-lth,l};
					if(r-p[i].x<=t){
						lth=t-(r-p[i].x)>>1;
						f[i][0]=f[i][0]+(qj){p[i].x,r+lth};
					}else{
						f[i][0]=f[i][0]+(qj){p[i].x,p[i].x+t};
					}
				}
			}else if(p[i].x<=r){
				if(p[i].x-l<=t){
					lth=t-(p[i].x-l)>>1;
					f[i][0]=f[i][0]+(qj){l-lth,p[i].x};
				}else{
					f[i][0]=f[i][0]+(qj){p[i].x-t,p[i].x};
				}
				if(f[i-1][1].r-p[i].x<=t){
					lth=t-(r-p[i].x)>>1;
					f[i][0]=f[i][0]+(qj){p[i].x,r+lth};
				}else{
					f[i][0]=f[i][0]+(qj){p[i].x,p[i].x+t};
				}
			}else{
				if(p[i].x-r<=t){
					int lth=t-(p[i].x-r)>>1;
					f[i][0]=f[i][0]+(qj){r,p[i].x+lth};
					if(p[i].x-l<=t){
						int lth=t-(p[i].x-l)>>1;
						f[i][0]=f[i][0]+(qj){l-lth,p[i].x};
					}else{
						f[i][0]=f[i][0]+(qj){p[i].x-t,p[i].x};
					}
				}
			}
		}
		if(p[i].x>=f[i-1][0].l&&p[i].x<=f[i-1][0].r)f[i][1]={p[i-1].x-t,p[i-1].x+t};
		if(f[i-1][0].l<=f[i-1][0].r){
			lth=t-abs(p[i].x-p[i-1].x);
			f[i][1]=f[i][1]+(qj){p[i].x-lth,p[i].x+lth};
		}
		if(lst[i]&&lst[i]==i-1){
        	if(f[i-1][1].l<=f[i-1][1].r)f[i][1]=f[i][1]+(qj){f[i-1][1].l-t,f[i-1][1].r+t};
		}else{
			if(lst[i]&&!(qz[i-1]-qz[lst[i]+1])&&f[lst[i]][1].l<=f[lst[i]][1].r){
				int l=f[lst[i]][1].l,r=f[lst[i]][1].r;
				if((l<=p[lst[i]+1].x&&p[lst[i]+1].x<=r)||min(abs(l-p[lst[i]+1].x),abs(r-p[lst[i]+1].x))<=p[lst[i]+1].t-p[lst[i]].t){
					f[i][1]=f[i][1]+(qj){p[i-1].x-t,p[i-1].x+t};
				}
			}
		}
		if(f[i-1][1].l<=f[i-1][1].r){
	    	int l=f[i-1][1].l,r=f[i-1][1].r;
	    	if(p[i].x<l){
	    		lth=t-(l-p[i].x);
	    		if(lth>=0)f[i][1]=f[i][1]+(qj){p[i].x-lth,p[i].x+lth};
	    	}else if(p[i].x<=r)f[i][1]=f[i][1]+(qj){p[i].x-t,p[i].x+t};
	    	else{
	    		lth=t-(p[i].x-r);
	    		if(lth>=0)f[i][1]=f[i][1]+(qj){p[i].x-lth,p[i].x+lth};
	    	}
	    }
	//	cout<<f[i][0].l<<" "<<f[i][0].r<<" "<<f[i][1].l<<" "<<f[i][1].r<<endl;
	}
	if(f[n][0].l<=f[n][0].r||f[n][1].l<=f[n][1].r){
		cout<<"YES";
		cerr<<"YES\n";
	}else cout<<"NO",cerr<<"NO\n";
}