#include <bits/stdc++.h>
#define ll long long
#define pii pair <int, int>
#define fi first
#define se second
#define pb push_back

using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 5005, inf = 0x3f3f3f3f; 
int n, g[N], t[N], x[N]; 
bool f[N][N]; 

void solve () {
	cin >> n; 
	for (int i = 1;i <= n;i++) cin >> t[i] >> x[i]; 
	memset(g, 0x3f, sizeof g); 
	g[0] = 0; 
	for (int i = 0;i <= n;i++) {
		if (i) g[i] = min(g[i], max(t[i-1], g[i-1])+abs(x[i]-x[i-1])); 
		if (i && x[i] == x[i-1]) g[i] = min(g[i], g[i-1]);  
		if (g[i] > t[i]) g[i] = inf; 
		if (i && f[i-1][i] && i < n) {
			g[i+1] = min(g[i+1], max(t[i], t[i-1]+abs(x[i+1]-x[i-1]))); 
			for (int j = i+1;j <= n;j++) f[i+1][j] |= (t[i+1]-t[i-1]) >= abs(x[i-1]-x[j])+abs(x[j]-x[i+1]); //, cout << i << " " << j << " " << "DCHK:" << t[i+1]-t[i-1] << " " << abs(x[i]-x[j]) << " " << abs(x[j]-x[i+1]) << " " << f[i+1][j] << endl;
		}
		if (g[i] <= t[i] && i < n) {
			for (int j = i+1;j <= n;j++) f[i+1][j] |= (t[i+1]-g[i]) >= abs(x[i]-x[j])+abs(x[j]-x[i+1]); //, cout << i << " " << j << " " << "CHK:" << t[i+1]-g[i] << " " << abs(x[i]-x[j]) << " " << abs(x[j]-x[i+1]) << " " << f[i+1][j] << endl;  
		} 
		for (int j = 0;j <= n;j++) f[i+1][j] |= f[i][j]&(t[i+1]-t[i] >= abs(x[i+1]-x[i])); 
//		for (int j = 0;j <= n;j++) cout << f[i][j] << " "; cout << endl; 
//		cout << g[i] << endl; 
	} //	cout << endl; 
	int fl = g[n] <= t[n] || f[n-1][n]; 
	for (int j = 0;j <= n;j++) fl |= f[n][j]; 
	puts(fl ? "YES" : "NO"); 
}

signed main () {
	int T = 1; 
	while (T--) solve();
	return 0;
}