#include<stdio.h>
int arr[9][9]={};
int cnt;
void dfs(int i, int j)
{
cnt++;
if(arr[i-1][j]==arr[i][j]&&arr[i][j]!=0)
{
dfs(i-1,j);
}
if(arr[i+1][j]==arr[i][j]&&arr[i][j]!=0)
{
dfs(i+1,j);
}
if(arr[i][j-1]==arr[i][j]&&arr[i][j]!=0)
{
dfs(i,j-1);
}
if(arr[i][j+1]==arr[i][j]&&arr[i][j]!=0)
{
dfs(i,j+1);
}
arr[i][j]=0;
}
int main()
{
int x,y=0,i,j;
for(i=1; i<=7; i++)
{
for(j=1; j<=7; j++)
{
scanf("%d",&arr[i][j]);
}
}
for(i=1; i<=7; i++)
{
for(j=1; j<=7; j++)
{
cnt=-1;
dfs(i,j);
if(cnt>=3)
{
y++;
}
}
}
printf("%d\n",y);
}