r = range(len(g := [[*map(int, line.strip())] for line in open("input")]))
n = lambda i,j:((k,l) for k,l in ((i,j-1),(i,j+1),(i-1,j),(i+1,j)) if (k in r)&(l in r))
bs = [(i,j) for i in r for j in r if all(g[k][l] > g[i][j] for k,l in n(i,j))]
def dfs(p): g[p[0]][p[1]] = 9; return 1+sum(dfs((i,j)) for i,j in n(*p) if g[i][j] != 9)
print(sum(1+g[i][j] for i,j in bs), (s:=sorted(map(dfs, bs)))[-1]*s[-2]*s[-3])