#include <bits/stdc++.h>

#define el '\n'
#define ll long long

#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

const int N = 52, INF = 1e9;

const double eps = 1e-9;

int dcmp(const double &a, const double &b){
    if(fabs(a - b) < eps)
        return 0;

    return (a > b ? 1 : -1);
}

struct Point
{
    int x;
    int y;
};

int r, c;
bool arr[N][N];
bool vis[N][N];
double dp[N][N];
bool can[N][N][N][N];

void pre() {
    for (int i = 0; i <= r; i++) {
        for (int j = 0; j <= c; j++) {
            for (int a = i; a <= r; a++) {
                for (int b = j; b <= c; b++) {
                    if (i == a || j == b)
                        continue;

                    double m = (double)(b - j) / (a - i), d = (double)j - m * i;

                    int cur = j;

                    for (int row = i + 1; row <= a; row++) {
                        while (cur <= b && dcmp(m * row + d, cur) == 1)
                            cur++;

                        if (dcmp(m * row + d, cur) != 1 && arr[row - 1][cur - 1])
                            can[i][j][a][b] = 1;
                    }

                    cur = i;

                    for (int col = j + 1; col <= b; col++) {
                        while (cur <= a && dcmp((double)(col - d) / m, cur) == 1)
                            cur++;

                        if (dcmp((double)(col - d) / m, cur) != 1 && arr[cur - 1][col - 1])
                            can[i][j][a][b] = 1;
                    }
                }
            }
        }
    }
}

double dist(int x, int y, int x2, int y2) {
    return sqrt((x2 - x) * (x2 - x) + (y2 - y) * (y2 - y));
}

double solve(int x, int y) {
    if (x == r && y == c)
        return 0;

    double &ret = dp[x][y];

    if (vis[x][y])
        return ret;

    vis[x][y] = 1;

    ret = INF;

    for (int i = x; i <= r; i++) {
        for (int j = y; j <= c; j++) {
            if (i == x && j == y || can[x][y][i][j])
                continue;

            ret = min(ret, dist(x, y, i, j) + solve(i, j));
        }
    }

    return ret;
}

void testCase() {
    cin >> r >> c;

    char x;
    for (int i = 0; i < r; i++) {
        for (int j = 0; j < c; j++) {
            cin >> x;

            if (x == '#')
                arr[i][j] = 1;
        }
    }

    pre();

    cout << fixed << setprecision(9) << solve(0, 0);
}

signed main() {
    Beevo

    int T = 1;
//    cin >> T;

    while (T--)
        testCase();

    return 0;
}