#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <iomanip>
#include <map>
using namespace std;
typedef long long LL;

void dfs(vector<string>& board, int x, int y){
    if(board[y][x] != '.') return;
    board[y][x] = 'o';
    if(x-1 >= 0) dfs(board, x-1, y);
    if(x+1 < board[0].size()) dfs(board, x+1, y);
    if(y-1 >= 0) dfs(board, x, y-1);
    if(y+1 < board.size()) dfs(board, x, y+1);
}

int iabs(int n){
    if(n < 0) return -n;
    return n;
}

int main(){
    int W, H;
    cin >> W >> H;
    vector<string> board(H);
    for(int i = 0; i < H; i++){
        cin >> board[i];
    }
    for(int y = 0; y < H; y++){
        for(int x = 0; x < W; x++){
            if(board[y][x] == '.'){
                dfs(board, x, y);
                y = H;
                break;
            }
        }
    }
    int ans = H*W;
    for(int y = 0; y < H; y++){
        for(int x = 0; x < W; x++){
            if(board[y][x] != 'o') continue;
            for(int y2 = 0; y2 < H; y2++){
                for(int x2 = 0; x2 < W; x2++){
                    if(board[y2][x2] == '.'){
                        ans = min(ans, iabs(x-x2)+iabs(y-y2)-1);
                    }
                }
            }
        }
    }
    cout <<  ans << endl;
    return 0;
}