#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int dp[100001][12];//dp[i][j]表示从第i秒j位置开始一直到结束能够获得的最多馅饼数
int main(){
int n, x, t;
while(scanf("%d", &n) != EOF){
int MAXt = 0;
memset(dp, 0, sizeof(dp));
for(int i = 0; i < n; i++){
scanf("%d%d", &x, &t);
dp[t][x]++;
MAXt = max(MAXt, t);
}
for(int i = MAXt - 1; i >= 0; i--)
for(int j = 0;j <= 10; j++)
dp[i][j] += max(dp[i+1][j+1], max(dp[i+1][j],dp[i+1][j-1]));
printf("%d\n", dp[0][5]);
}
return 0;
}
//presented by 大吉大利,今晚AC