// #pragma GCC target("avx")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

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

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>

template<typename T>
void chmax(T &a, const T &b) {a = (a > b? a : b);}
template<typename T>
void chmin(T &a, const T &b) {a = (a < b? a : b);}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 5000;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};

#define int long long

template<typename T>
struct Edge {
    int to;
    T cap;
    int rev;

    Edge() = default;
    Edge(int to, T cap, int rev) : to(to), cap(cap), rev(rev) {}
};

template<typename T>
struct Dinic {
    const T e = numeric_limits<T>::max();
    const T zero = 0;

    int n;
    vector<vector<Edge<T>>> g;
    vector<int> level, iter;
    vector<pair<int, int>> Edge_ID;

    Dinic(int n) : n(n), g(n) {}

    int add_edge(int from, int to, T cap) {
        Edge<T> f(to, cap, g[to].size());
        Edge<T> t(from, zero, g[from].size());

        int Now_Edge_ID = (int)Edge_ID.size();
        Edge_ID.emplace_back(from, (int)g[from].size());

        g[from].push_back(f);
        g[to].push_back(t);
        
        return Now_Edge_ID;
    }

    bool bfs(int s, int t) {
        level.assign(n, -1);
        level[s] = 0;
        queue<int> que;
        que.push(s);

        while(que.size()) {
            int v = que.front();
            que.pop();

            for(auto e : g[v]) {
                if(e.cap > zero && level[e.to] < 0) {
                    level[e.to] = level[v] + 1;
                    que.push(e.to);
                }
            }
        }

        return level[t] != -1;
    }

    T dfs(int v, int t, T f) {
        if(v == t) return f;

        for(int& i = iter[v]; i < g[v].size(); i++) {
            Edge<T>& e = g[v][i];

            if(e.cap > zero && level[v] < level[e.to]) {
                T d = dfs(e.to, t, min(f, e.cap));

                if(d > zero) {
                    e.cap -= d;
                    g[e.to][e.rev].cap += d;
                    return d;
                }
            }
        }

        return zero;
    }

    T flow(int s, int t) {
        T f = zero;

        while(bfs(s, t)) {
            iter.assign(n, 0);
            T d;

            while((d = dfs(s, t, e)) > zero) f += d;
        }

        return f;
    }

    //sから見たときのmin_cutにおいてs側に所属するかどうかを全頂点に対して返すO(N)
    vector<bool> min_cut(int s) {
        vector<bool> visited(n, false);
        queue<int> que;
        visited[s] = true;
        que.push(s);
        while(!que.empty()) {
            int v = que.front();
            que.pop();
            for(auto e : g[v]) if(e.cap != 0 && !visited[e.to]) {
                visited[e.to] = true;
                que.push(e.to);
            }
        }
        return visited;
    }

    Edge<T> get_edge(int edge_id) {
        return g[Edge_ID[edge_id].first][Edge_ID[edge_id].second];
    }
};

//bipartite matching 
//TODO: make faster Dinic using dynamic tree structure and current edge structure
//燃やす埋めるref: https://qiita.com/ningenMe/items/69ed7ce43c9cd0a2de38

//add_edgeにintの返り値を持たせて、id = add_edge(), get_edge(id) = 元の辺　みたいにしたい。
//min_cut : 右側ならばtrueのvector<bool>を返す。
//cut[from] = true && cut[to] = false --- from->toの辺が最小カットで切られる辺の一つ

void solve() {
    int h, w;
    cin >> h >> w;
    vector<string> s(h);
    FOR(h) cin >> s[i];

    auto reach = [&]() -> bool {
        vector<vector<bool>> can(h-2, vector<bool>(w-2, true));
        rep(i, h-2) rep(j, w-2) {
            rep(px, 3) rep(py, 3) {
                if(s[i+px][j+py] == '#') can[i][j] = false;
            }
        }

        queue<pii> que;
        vector<vector<bool>> vis(h-2, vector<bool>(w-2, false));
        vis[0][0] = true;
        que.emplace(0, 0);

        while(!que.empty()) {
            int x, y;
            tie(x, y) = que.front();
            que.pop();

            rep(d, 8) {
                int nx = x + dx[d];
                int ny = y + dy[d];

                if(nx < 0 || ny < 0 || nx+2 >= h || ny+2 >= w) continue;
                if(!can[nx][ny] || vis[nx][ny]) continue;

                vis[nx][ny] = true;
                que.emplace(nx, ny);
            }
        }

        return vis[h-3][w-3];
    };

    if(!reach()) {
        cout << 0 << endl;
        return;
    }
    rep(i, h) rep(j, w) if(s[i][j] != '#') {
        if(i<3&&j<3) continue;
        if(i>=h-3&&j>=h-3) continue;

        s[i][j] = '#';
        if(!reach()) {
            cout << 1 << endl;
            return;
        }
        s[i][j] = '.';
    }
    cout << 2 << endl;

    // Dinic<int> dinic(h*w*2);
    // rep(i, h) rep(j, w) dinic.add_edge(i*w+j, i*w+j+h*w, 1);

    // rep(i, h-2) rep(j, w-2) {
    //     bool can_from = true;
    //     rep(ip, 3) rep(jp, 3) if(s[i+ip][j+jp] == '#') {
    //         can_from = false;
    //     }
    //     if(!can_from) continue;

    //     rep(d, 8) {
    //         int ni = i + dx[d];
    //         int nj = j + dy[d];

    //         if(ni < 0 || nj < 0 || ni+2 >= h || nj+2 >= w) continue;
    //         bool flag = true;
    //         rep(ip, 3) rep(jp, 3) if(s[ni+ip][nj+jp] == '#') flag = false;
    //         if(!flag) continue;
            
    //         dinic.add_edge(i*w+j+h*w, ni*w+nj, INF);
    //         // printf("(%lld,%lld)->(%lld,%lld)\n", i, j, ni, nj);
    //     }
    // }
    // cout << dinic.flow(h*w, (h-3)*w+(w-3)) << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}