#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 998244353;

int main() {
    ll H, W;
    cin >> H >> W;

    vector<string> S(H);
    for (ll i = 0; i < H; i++) cin >> S[i];

    S[0][0] = '.';
    S[H - 1][W - 1] = '.';
    queue<tuple<ll, ll, ll, ll>> que;
    que.emplace(0, 0, 0, 0);
    vector<vector<vector<ll>>> memo(3,
                                    vector<vector<ll>>(H, vector<ll>(W, -1)));

    // 0: 普通
    // 1: 上下
    // 2: 左右
    while (!que.empty()) {
        ll dis, t, x, y;
        tie(dis, t, x, y) = que.front();
        que.pop();
        if (t == 0 && S[x][y] == '#') continue;
        if (memo[t][x][y] == -1) {
            //cerr <<dis << " "<< t << " " << x << " " << y << endl;
            memo[t][x][y] = dis;
            if (t == 0) {
                if (x != 0) {
                    que.emplace(dis + 1, 0, x - 1, y);
                    que.emplace(dis + 1, 2, x - 1, y);
                }
                if (x != H - 1) {
                    que.emplace(dis + 1, 0, x + 1, y);
                    que.emplace(dis + 1, 2, x, y);
                }
                if (y != 0) {
                    que.emplace(dis + 1, 0, x, y - 1);
                    que.emplace(dis + 1, 1, x, y - 1);
                }
                if (y != W - 1) {
                    que.emplace(dis + 1, 0, x, y + 1);
                    que.emplace(dis + 1, 1, x, y);
                }
            }
            if (t == 1) {
                if (x != 0) { que.emplace(dis + 1, 1, x - 1, y); }
                if (x != H - 1) { que.emplace(dis + 1, 1, x + 1, y); }
                que.emplace(dis + 1, 0, x, y);
                que.emplace(dis + 1, 0, x, y + 1);
            }
            if(t == 2){
                if (y != 0) { que.emplace(dis + 1, 2, x, y - 1); }
                if (y != W - 1) { que.emplace(dis + 1, 2, x, y + 1); }
                que.emplace(dis + 1, 0, x, y);
                que.emplace(dis + 1, 0, x + 1, y);
            }
        }
    }
    cout << memo[0][H - 1][W - 1] << endl;
}