hdu 1176

#include <iostream>
#include <cstdlib>
#include <cstdio>

using namespace std;

int a[15];
int aa[11][100005];

int maxx(int x,int y,int z)
{
	int a = x>y?x:y;
	return a>z?a:z;
}
void deal(int times)
{
	if(times==1)
	{a[4]=aa[4][1];a[5]=aa[5][1];a[6]=aa[6][1];return ;}
	int temp[12];
	memset(temp,0,sizeof(temp));
	for(int i=0;i<11;i++)
	{  
		if(i==0) temp[i]=a[i]+aa[i][times]>a[i+1]+aa[i][times]?a[i]+aa[i][times]:a[i+1]+aa[i][times];
		else
		//if(aa[i][times]!=0)
			temp[i]=maxx(a[i-1]+aa[i][times],a[i]+aa[i][times],a[i+1]+aa[i][times]);
		if(temp[i]==aa[i][times]&&(i<5-times||i>5+times)) temp[i]=0;
	}
	for(int i=0;i<11;i++)
		a[i]=temp[i];
}
void init()
{  
	
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		if(n==0) break;
		int times = 1;

		memset(aa,0,sizeof(aa));
		memset(a,0,sizeof(a));

		for(int i=0;i<n;i++)
		{
			int x,y;
			scanf("%d%d",&x,&y);
			aa[x][y]++;
			times = y>times?y:times;
		}

		for(int i=1;i<=times;i++)
		{
			deal(i);
		}

		int sum = 0;
		for(int i=0;i<11;i++)
			if(a[i]>sum) sum = a[i];
		printf("%d\n",sum);
	}
}
int main()
{
	init();
	return 0;
}