警钟敲烂

/*我的CSP-S T1 代码
Luogu UID:363061
ID:sqh_let_it_be
RP++
score++
*/
#include<bits/stdc++.h>
using namespace std;
int lock[9][10],cf[9][10],n;
int mm[25],zj[11][11][11][11][11],ans;
map<int,int> da;
inline int read()
{
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){s=s*10+ch-48;ch=getchar();}
	return s*w;
}
int main()
{
	freopen("lock.in","r",stdin);
	freopen("lock.out","w",stdout); 
	n=read();
	for(int i=1;i<=n;i++)
		for(int j=1;j<=5;j++)
			lock[i][j]=read();
	for(int i=1;i<=n;i++)
	{
		int tem1=lock[i][1];
		int tem2=lock[i][2];
		int tem3=lock[i][3];
		int tem4=lock[i][4];
		int tem5=lock[i][5];
		for(int k=1;k<=9;k++)
		{
			// 单个转 
			zj[(tem1+k)%10][tem2][tem3][tem4][tem5]++;
			zj[tem1][(tem2+k)%10][tem3][tem4][tem5]++;
			zj[tem1][tem2][(tem3+k)%10][tem4][tem5]++;
			zj[tem1][tem2][tem3][(tem4+k)%10][tem5]++;
			zj[tem1][tem2][tem3][tem4][(tem5+k)%10]++;
			//相邻转
			zj[(tem1+k)%10][(tem2+k)%10][tem3][tem4][tem5]++;
			zj[tem1][(tem2+k)%10][(tem3+k)%10][tem4][tem5]++;
			zj[tem1][tem2][(tem3+k)%10][(tem4+k)%10][tem5]++;
			zj[tem1][tem2][tem3][(tem4+k)%10][(tem5+k)%10]++;
		}
	}
	for(int a=0;a<=9;a++)
		for(int b=0;b<=9;b++)
			for(int c=0;c<=9;c++)
				for(int d=0;d<=9;d++)
					for(int e=0;e<=9;e++)
						if(zj[a][b][c][d][e]==n)
							ans++; 
	printf("%d\n",ans);
	fclose(stdin);
	fclose(stdout);
	return 0;
}