#include<iostream>
using namespace std;
int a[6][6];
int ans[10000]={-1,-1,-1}, w = 0;
bool judge(int x) {
for (int i = 0;i <= w;i++) {
if (ans[i] == x)return 0;
}
return 1;
}
void dfs(int i, int j, int cnt = 0, int temp = 0)
{
if (i < 0 || i>4 || j < 0 || j>4)return;
cnt++;
if (cnt < 6) {
temp = temp * 10 + a[i][j];
dfs(i - 1, j, cnt, temp);
dfs(i , j+1, cnt, temp);
dfs(i +1, j, cnt, temp);
dfs(i, j-1, cnt, temp);
}
if (cnt == 6) {
temp = temp * 10 + a[i][j];
if (judge(temp))ans[++w] = temp;
return;
}
}
int main(){
for (int i = 0;i < 5;i++) {
for (int j = 0;j < 5;j++) { cin >> a[i][j]; }
}
for (int i = 0;i < 5;i++) {
for (int j = 0;j < 5;j++) {
dfs(i,j);
}
}
cout << w << endl;
}