#include <bits/stdc++.h>
using namespace std;

int h, w;
const int MAX = 30;
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};

char C[MAX][MAX];
bool seen[MAX][MAX];
int D[MAX][MAX];

struct UnionFind{
    vector<int> par;
    UnionFind(int N) : par(N){
        for(int i = 0; i < N; i++){
            par[i] = -1;
        }
    }
    int root(int x){
        if(par[x] < 0) return x;
        else return par[x] = root(par[x]);
    }
    void unite(int x, int y){
        int rx = root(x);
        int ry = root(y);
        if(rx == ry) return;
        else{
            if(par[rx] == par[ry]){
                if(rx > ry) swap(rx, ry);
            }else if(par[rx] > par[ry]) swap(rx, ry);
            par[rx] += par[ry];
            par[ry] = rx;
       }
    }
    bool same(int x, int y){
        return root(x) == root(y);
    }
    void check(){
        for(auto x : par){
            cout << x << " ";
        }
        cout << endl;
    }
};

void dfs(int x, int y, UnionFind &uf){
    seen[x][y] = true;
    for(int i = 0; i < 4; i++){
        int nx, ny;
        nx = dx[i] + x;
        ny = dy[i] + y;
        if(nx < 0 or ny < 0 or nx >= h or ny >= w) continue;
        if(C[nx][ny] == '#' or seen[nx][ny]) continue;
        uf.unite(x * w + y, nx * w + ny);
        dfs(nx, ny, uf);
    }
    return;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    cin >> w >> h;
    for(int i = 0; i < h; i++){
        for(int j = 0; j < w; j++){
            cin >> C[i][j];
            D[i][j] = 1e9;
        }
    }

    UnionFind uf(h * w);
    for(int i = 0; i < h; i++){
        for(int j = 0; j < w; j++){
            if(C[i][j] == '.'){
                if(!seen[i][j]){
                    dfs(i, j, uf);
                }
            }
        }
    }

    queue<pair<int, int>> q;
    bool f = true;
    int bp;
    for(int i = 1; i < h - 1; i++){
        for(int j = 1; j < w - 1; j++){
            if(C[i][j] == '#') continue;
            int r = uf.root(i * w + j);
            if(f and uf.par[r] != -1){
                bp = r;
                f = false;
                q.push({i, j});
            }else if(!f and r == bp){
                q.push({i, j});
            }
        }
    }

    int ans = 1e9;
    for(int i = 1; i < h - 1; i++){
        for(int j = 1; j < w - 1; j++){
            if(C[i][j] == '#') continue;
            for(int k = 1; k < h - 1; k++){
                for(int l = 1; l < w - 1; l++){
                    if(C[k][l] == '#') continue;
                    if(!uf.same(i * w + j, k * w + l)){
                        ans = min(ans, abs(i - k) + abs(j - l) - 1);
                    }
                }
            }
        }
    }

    cout << ans << endl;

    return 0;
}