from itertools import *
from bisect import *
from math import *
from collections import *
from heapq import *
from random import *
import numpy as np
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
dij=[(1,0),(0,1),(-1,0),(0,-1)]

def main():
    def dfs(i,j,g):
        for di,dj in dij:
            ni,nj=i+di,j+dj
            if ni<0 or ni>=h or nj<0 or nj>=w:
                continue
            if t[ni][nj]!=1:continue
            t[ni][nj]=0
            ij[g].append((ni,nj))
            dfs(ni,nj,g)

    ij=[[],[]]
    w,h=MI()
    t=[[(c==".")*1 for c in input()] for _ in range(h)]
    g=0
    for i in range(h):
        for j in range(w):
            if t[i][j]==1:
                t[i][j]=0
                ij[g].append((i,j))
                dfs(i,j,g)
                g+=1
            if g==2:break
        if g==2:break
    ans=100
    for i0,j0 in ij[0]:
        for i1,j1 in ij[1]:
            val=abs(i0-i1)+abs(j0-j1)-1
            if val<ans:ans=val
    print(ans)

main()