#include<bits/stdc++.h>
using namespace std;
char a[50][50];
int b[50][50];
int n,m;
int fx[5]={0,0,1,0,-1};
int fy[5]={0,1,0,-1,0};
void dfs(int x,int y,int k){
	//a[x][y]='#';
	b[x][y]=k;
	int tx,ty;
	for(int i=1;i<=4;i++){
		tx=x+fx[i];
		ty=y+fy[i];
		if(tx>=1&&tx<=n&&ty>=1&&ty<=m&&a[tx][ty]=='.'&&k+1<b[tx][ty]){
			  dfs(tx,ty,k+1);
		}
	}
}
int main(){
	
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>a[i][j];
			b[i][j]=INT_MAX;
		}
	}
	dfs(1,1,1);
	cout<<b[n][m];

	return 0;
}

/**************************************************************
	Problem: 1432
	User: hulaoshi
	Language: C++
	Result: Accepted
	Time:29 ms
	Memory:2084 kb
****************************************************************/