trees = open("input.txt", "r").read().splitlines()

score = [[0 for k in range(len(trees))] for l in range(len(trees[0]))]

for i in range(len(trees)):
    for j in range(len(trees[0])):
        n, s, w, o = 0, 0, 0, 0
        for k in range(i)[::-1]:
            if trees[i][j] > trees[k][j]:
                n += 1
            else:
                n += 1
                break
        for k in range(i + 1, len(trees)):
            if trees[i][j] > trees[k][j]:
                s += 1
            else:
                s += 1
                break
        for k in range(j)[::-1]:
            if trees[i][j] > trees[i][k]:
                w += 1
            else:
                w += 1
                break
        for k in range(j + 1, len(trees[0])):
            if trees[i][j] > trees[i][k]:
                o += 1
            else:
                o += 1
                break
        score[i][j] = n * s * w * o

print(max([x for y in score for x in y]))