//No.157 2つの空洞

import java.util.*;
import java.io.*;
import static java.util.Arrays.*;
import static java.lang.Math.*;

public class No157 {

    static final InputStream in = System.in;
    static final PrintWriter out = new PrintWriter(System.out,false);

    static void solve(){
        w = nextInt();
        h = nextInt();
        cs = new char[h][w];
        for (int i=0; i<h; i++) {
            cs[i] = next().toCharArray();
        }

        visited = new BitSet(w*h);

        outer:
        for (int i=0; i<h; i++) {
            for (int j=0; j<w; j++) {
                if (cs[i][j] == '.') {
                    dfs(i,j);
                    break outer;
                }
            }
        }

        int ans = Integer.MAX_VALUE;
        for (int i=0; i<h; i++) {
            for (int j=0; j<w; j++) {
                if (visited.get(i*w+j)) {
                    for (int k = 0; k<4; k++) {
                        int ny = i + dy[k];
                        int nx = j + dx[k];
                        if (!visited.get(ny*w+nx)) ans = min(ans,bfs(ny,nx));
                    }
                }
            }
        }

        out.println(ans);
    }

    static int w,h;
    static int[] dy = {0,0,1,-1};
    static int[] dx = {1,-1,0,0};
    static char[][] cs;
    static BitSet visited;

    static void dfs(int y, int x) {
        visited.set(y*w+x);
        for (int i=0; i<4; i++) {
            int ny = y + dy[i];
            int nx = x + dx[i];
            if (!visited.get(ny*w+nx) && cs[ny][nx] == '.') {
                dfs(ny,nx);
            }
        }
    }


    static int bfs(int y, int x) {
        ArrayDeque<Integer> que = new ArrayDeque<Integer>();
        que.add(y*w+x);
        int[] d = new int[w*h];
        fill(d,Integer.MAX_VALUE);
        d[y*w+x] = 0;
        while (!que.isEmpty()) {
            int cur = que.pollFirst();
            int cy = cur/w;
            int cx = cur%w;
            for (int i=0; i<4; i++) {
                int ny = cy + dy[i];
                int nx = cx + dx[i];
                if (ny < 0 || h <= ny || nx < 0 || w <= nx) continue;
                if (!visited.get(ny*w+nx) && cs[ny][nx] == '.') {
                    return d[cur]+1;
                }else if (cs[ny][nx] == '#' && d[ny*w+nx] > d[cur] + 1) {
                    que.add(ny*w+nx);
                    d[ny*w+nx] = d[cur] + 1;
                }
            }
        }

        return Integer.MAX_VALUE;
    }

    public static void main(String[] args) throws Exception {
        long start = System.currentTimeMillis();

        solve();
        out.flush();

        long end = System.currentTimeMillis();
        //trace(end-start + "ms");
        in.close();
    }

    static void trace(Object... o) { System.out.println(deepToString(o));}

    static final byte[] buf = new byte[1024];
    static int ptr = 0;
    static int buflen = 0;

    static boolean hasNextByte() {
        if (ptr < buflen)
            return true;
        ptr = 0;
        try{
            buflen = in.read(buf);
        }catch (IOException e) {e.printStackTrace();}
        if (buflen <= 0)
            return false;
        return true;
    }

    static int readByte() { if (hasNextByte()) return buf[ptr++]; else return -1;}

    static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}

    static void skip() { while(hasNextByte() && !isPrintableChar(buf[ptr])) ptr++;}

    static boolean hasNext() {skip(); return hasNextByte();}

    static String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    static long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        boolean minus = false;
        long num = readByte();

        if(num == '-'){
            num = 0;
            minus = true;
        }else if (num < '0' || '9' < num){
            throw new NumberFormatException();
        }else{
            num -= '0';
        }
        
        while(true){
            int b = readByte();
            if('0' <= b && b <= '9')
                num = num * 10 + (b - '0');
            else if(b == -1 || !isPrintableChar(b))
                return minus ? -num : num;
            else
                throw new NoSuchElementException();
        }
    }

    static int nextInt() {
        long num = nextLong();
        if (num < Integer.MIN_VALUE || Integer.MAX_VALUE < num)
            throw new NumberFormatException();
        return (int)num;
    }

    static double nextDouble() {
        return Double.parseDouble(next());
    }

    static char nextChar() {
        if (!hasNext()) throw new NoSuchElementException();
        return (char)readByte();
    }

    static String nextLine() {
        while (hasNextByte() && (buf[ptr] == '\n' || buf[ptr] == '\r')) ptr++;
        if (!hasNextByte()) throw new NoSuchElementException();

        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (b != '\n' && b != '\r') {
            sb.appendCodePoint(b);
            b = readByte();
        }

        return sb.toString();
    }

    static int[] nextArrayInt(int n) {
        int[] a = new int[n];
        for (int i=0; i<n; i++) a[i] = nextInt();
        return a;
    }
}