#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf=1e9+7;

int H,W;
string s[21];
bool ok;
int f[21][21];
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
vector<pair<int,int>> vt[2];
int main(){
    cin>>W>>H;
    REP(i,0,H){
        cin>>s[i];
    }

    REP(l,0,2) {
        queue<pair<int,int>> q;
        REP(i, 0, H) {
            REP(j, 0, W) {
                if (s[i][j] == '.'&&f[i][j]==0) {
                    f[i][j] = 1;
                    vt[l].push_back({i, j});
                    q.push({i, j});
                    break;
                }
            }
            if (!q.empty()) break;
        }
        while (!q.empty()) {
            auto now = q.front();
            q.pop();
            int i = now.F, j = now.S;
            REP(k, 0, 4) {
                if (!CK(i + dy[k], 0, H) || !CK(j + dx[k], 0, W)) continue;
                if (s[i + dy[k]][j + dx[k]] == '.' && f[i + dy[k]][j + dx[k]] == 0) {
                    f[i + dy[k]][j + dx[k]] = 1;
                    vt[l].push_back({i + dy[k], j + dx[k]});
                    q.push({i + dy[k], j + dx[k]});
                }
            }
        }
    }

    int ans = inf;
    for(auto v1:vt[0]){
        for(auto v2:vt[1]){
            ans = min(ans, abs(v2.F-v1.F)+abs(v1.S-v2.S)-1);
        }
    }
    p(ans);
    return 0;
}