#include<iostream>
#include<queue>
#include<algorithm>
#include<map>
#include<string.h>
#include<math.h>
#include<stdio.h>
#include <iomanip>
#include <stack>
#include <vector>
#include <sstream>
using namespace std;
int dx[] = { -1, -1, -1,0,0,1,1,1 };
int dy[] = { -1,0,1,-1,1,-1,0,1};
char pixels[40][40];
bool visited[40][40];
int Size;
typedef pair<int,int>p;
queue<p>que;
/
void bfs()
{
int x,y;
while(!que.empty())
{
p temp = que.front();
que.pop();
for(int i=0;i<8;i++)
{
x=temp.first+dx[i];
y=temp.second+dy[i];
if(0<=x && x<Size && 0<=y && y<Size && !visited[x][y]
&& pixels[x][y]=='1')
{
visited[x][y] = true;
que.push(p(x,y));
}
}
}
}
int main()
{
int i,j;
int image_number = 1;
while(scanf("%d",&Size)==1)
{
while(!que.empty())
que.pop();
memset(visited,false,sizeof(visited));
memset(pixels,0,sizeof(pixels));
int count = 0;
getchar();
for(i=0;i<Size;i++)
gets(pixels[i]);
for(i=0;i<Size;i++)
for(j=0;j<Size;j++)
{
if(pixels[i][j]=='1' && !visited[i][j])
{
visited[i][j] = true;
que.push(p(i,j));
bfs();
//for(int k=0;k<Size;k++)
// {
// for(int n=0;n<Size;n++)
// cout<<visited[k][n];
// cout<<endl;
//}
count++;
}
}
cout<<"Image number "<<image_number<<" contains "<<count<<" war eagles."<<endl;
image_number++;
}
}