hdu2164

#include<cstdio>
#include<string>
int n;
int map[16][16];
int dif;
int maxs;
int f[16];
void dfs(int c,int sum)
{
	
	
	maxs=maxs<sum? sum: maxs;
	if(sum==n||maxs==n)return;
	int i;
	for(i=0;i<n;i++)
	{
		if(map[c][i]>=dif&&f[i]==0)
		{
			f[i]=-1;
			int temp=dif;
			dif=map[c][i];
			dfs(i,sum+1);
			dif=temp;
			f[i]=0;
		}
	}
}

int main()
{
	while(scanf("%d",&n)!=EOF)
	{
		int i,j;
		for(i=0;i<n;i++)
			for(j=0;j<n;j++)
				scanf("%d",&map[i][j]);
			dif=0;
			maxs=1;
			memset(f,0,sizeof(f));
			f[0]=-1;
			dfs(0,1);
			printf("%d\n",maxs);
	}
	return 0;
}