#include <stdio.h>
int arr[100][100]= {}, count[400]= {}, coont[400]= {};
int m, sum=0, som=0;
void dfs1(int k, int p, int way)
{
if(k>19||p>19||k<1||p<1||arr[k][p]==0||arr[k][p]==2)
{
return;
}
sum++;
if(way==1)
{
dfs1(k+1, p, way);
}
if(way==2)
{
dfs1(k, p+1, way);
}
if(way==3)
{
dfs1(k+1, p+1, way);
}
if(way==4)
{
dfs1(k+1, p-1, way);
}
}
void dfs2(int k, int p, int way)
{
if(k>19||p>19||k<1||p<1||arr[k][p]==0||arr[k][p]==1)
{
return;
}
som++;
if(way==1)
{
dfs2(k, p+1, way);
}
if(way==2)
{
dfs2(k+1, p, way);
}
if(way==3)
{
dfs2(k+1, p+1, way);
}
if(way==4)
{
dfs2(k+1, p-1, way);
}
}
int main()
{
int i, j, way, a=0;
for(j=1; j<=19; j++)
{
for(i=1; i<=19; i++)
{
scanf("%d", &arr[i][j]);
}
}
for(j=1; j<=19; j++)
{
for(i=1; i<=19; i++)
{
if(arr[i][j]==1)
{
for(way=1; way<=4; way++)
{
sum=0;
dfs1(i, j, way);
printf("black(%d, %d) %d\n", j, i, sum);
if(sum==5)
{
printf("1\n");
printf("%d %d\n", j, i);
a+=1;
}
}
}
if(arr[i][j]==2)
{
for(way=1; way<=4; way++)
{
som=0;
dfs2(i, j, way);
printf("white(%d, %d) %d\n", j, i, sum);
if(som==5)
{
printf("2\n");
printf("%d %d\n", j, i);
a+=1;
}
}
}
}
}
if(a==0)
{
printf("0");
}
return 0;
}