def dfs(x,y,nprev)
if x<0||$a[0].size<=x || y<0||$a.size<=y || $a[y][x]<=nprev
return 0
end
if $memo[[x,y]]
return $memo[[x,y]]
end
n=[[-1,0],[1,0],[0,-1],[0,1]].map{|_x,_y|
dfs(x+_x,y+_y,$a[y][x])+1
}.max
$memo[[x,y]]=n
end
while gets
$a=$_.chomp.split('/').map{|e|e.split('').map(&:to_i)}
$memo={}
p $a.size.times.map{|y|$a[0].size.times.map{|x|dfs(x,y,-1)}.max}.max
end