def dfsf(c,x,y):
d=0
if a[x][y+1]==c:
d = 6
dfs(c,x,y+1,6,2)
if a[x+1][y-1]==c:
d = 7
dfs(c,x+1,y-1,7,2)
if a[x+1][y]==c:
d = 8
dfs(c,x+1,y,8,2)
if a[x+1][y+1]==c:
d = 9
dfs(c,x+1,y+1,9,2)
def dfs(c,x,y,d,t):
global s,f
s=t
if t>5:
s=6
return
elif d==6 and a[x][y+1]==c:
dfs(c,x,y+1,d,t+1)
elif d==7 and a[x+1][y-1]==c:
dfs(c,x+1,y-1,d,t+1)
f=1
elif d==8 and a[x+1][y]==c:
dfs(c,x+1,y,d,t+1)
elif d==9 and a[x+1][y+1]==c:
dfs(c,x+1,y+1,d,t+1)
return
a=[[0 for i in range(21)]]
s=int(0)
w=int(0)
x=int(0)
y=int(0)
f=int(0)
for i in range(19):
p=[]
p=list(map(int,input().split()))
p.append(0)
p.insert(0,0)
a.append(p)
p=[0 for i in range(21)]
a.append(p)
a.insert(0,p)
for i in range(21):
for j in range(21):
if a[i][j]==1 or a[i][j]==2:
dfsf(a[i][j],i,j)
if s==5:
w=a[i][j]
if f==1:
x=i+4
y=j-4
f=0
x=i-1
y=j
print(w)
if w!=1:
print(x,y,sep=" ")