#include<cstdio>
#include<cstdlib>
#include<cstring>
#define N 10
#define ri register int
#define fo(i,l,r) for(ri i=l;i<=r;i++)
#define rf(i,r,l) for(ri i=r;i>=l;i--)
#define ll long long
using namespace std;
int n,a[N][6],num[6],cnt,ans;
bool check(int x)
{
	fo(i,1,5)num[i]=x%10,x/=10;
	fo(i,1,n)
	{
		ri j=1;
		for(;j<=5&&a[i][j]==num[j];j++);
		if(j>5)return 0;
		if(j==5)continue;
		fo(k,j+2,5)if(a[i][k]^num[k])return 0;
		if(a[i][j+1]==num[j+1])continue;
		if((num[j]-a[i][j]+10)%10!=(num[j+1]-a[i][j+1]+10)%10)return 0;
	}
	return 1;
}
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
int main(){
	freopen("lock.in","r",stdin);freopen("lock.out","w",stdout);
	n=read();fo(i,1,n)fo(j,1,5)a[i][j]=read();
	fo(i,0,99999)
		if(check(i))
			ans++;
	printf("%d",ans);
	return 0;
}