from queue import deque
from itertools import product
H, W = map(int, input().split())
S = []
for i in range(H):
S.append(input())
if 'o' in S[-1]:
r0, c0 = i, S[-1].index('o')
visited = set([(r0, c0)])
que = deque([(r0 + i, c0 + j, 1) for i, j in ((1, 0), (-1, 0), (0, 1), (0, -1))])
while que:
r, c, d = que.popleft()
if (r, c) in visited or r < 0 or c < 0 or r == H or c == W:
continue
visited.add((r, c))
if S[r][c] == 'o':
print(d)
exit()
for i, j in ((1, 0), (-1, 0), (0, 1), (0, -1)):
que.append((r + i, c + j, d + 1))
print('hoge')