#include <bits/stdc++.h>
using namespace std;
const int N = 10;
int n, anss;
int a[N][N];
int ansx[N];

int dis(int x, int y)
{
	for(int i = 0; i <= 8; i++)
	{
		if(x == y) return i;
		x++;
		if(x == 10) x = 0;
	}
}

bool check()
{	
	int ssum = 0;
	for(int i = 1; i <= n; i++)
	{
		int sum = 0;
		for(int j = 1; j <= 5; j++)
		{
			if(ansx[j] != a[i][j]) sum++;
		}
		if(sum > 2 || sum == 0) return 0;	
		if(sum == 1) ssum++;
	}
	if(ssum == n) return 1;
	for(int i = 1; i <= n; i++)
	{
		for(int j = 2; j <= 5; j++)
		{
			int disx = dis(ansx[j - 1], a[i][j - 1]);
			int disy = dis(ansx[j], a[i][j]);
			if(disx && disy && (disx == disy || disx + disy == 10) && !(ansx[j] == a[i][j] && ansx[j - 1] == a[i][j - 1])) return 1;
		}
	}
	return 0;
}

void dfs(int x)
{
	if(x > 5)
	{
		if(check())
		{
			anss++;
		}
		return ;
	}
	for(int i = 0; i <= 9; i++)
	{
		ansx[x] = i;
		dfs(x + 1);
	}
}

int main()
{
	//freopen("lock.in", "r", stdin);
	//freopen("lock.out", "w", stdout);
	std::ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	cin >> n;
	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= 5; j++) cin >> a[i][j];
	}
	if(n == 1)
	{
		cout << 81 << "\n";
		return 0;
	}
	if(n == 2)
	{
		int ans = 0;
		int sum = 0;
		for(int i = 1; i <= 5; i++)
		{
			if(a[1][i] != a[2][i]) sum++;
		}
		if(sum == 0)
		{
			cout << 81 << "\n";
			return 0;
		}
		if(sum == 1) ans += 8;
		if(sum <= 2)
		{
			for(int i = 2; i <= 5; i++)
			{
				for(int k = 1; k <= 8; k++)
				{
					int ansx = (a[1][i - 1] + k) % 10;
					int ansy = (a[1][i] + k) % 10;
					int disx = dis(ansx, a[2][i - 1]);
					int disy = dis(ansy, a[2][i]);
					if(disx && disy && (disx == disy || disx + disy == 10) && !(a[1][i] == a[2][i] && a[1][i - 1] == a[2][i - 1])) ans++;
				}
			}		
		}
		cout << ans << "\n";
		return 0;
	}
	dfs(1);
	cout << anss << "\n";
	return 0;
}