#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
char arr[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> arr[i][j];
}
}
deque<pair<int, int>> qu;
qu.push_back({0, 0});
int di[4] = {0, 0, -1, 1};
int dj[4] = {1, -1, 0, 0};
vector<vector<int>> dp(n + 1, vector<int>(m + 1, INT_MAX));
dp[0][0] = 0;
while (qu.size()) {
auto [u, v] = qu.front();
qu.pop_front();
//cout << "HERE";
for (int i = 0; i < 4; i++) {
int du = u + di[i];
int dv = v + dj[i];
if (du < 0 || du >= n || dv < 0 || dv >= m) continue;
if (arr[du][dv] == '.' || dp[du][dv] != INT_MAX) continue;
if (arr[du][dv] == arr[u][v]) dp[du][dv] = dp[u][v], qu.push_front({du, dv});
else if (arr[du][dv] != arr[u][v]) dp[du][dv] = dp[u][v] + 1, qu.push_back({du, dv});
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
//cout << dp[i][j] << ' ';
if (dp[i][j] != INT_MAX) ans = max(ans, dp[i][j]);
}
//cout << '\n';
}
cout << ans + 1;
return 0;
}
/*
a + b = 10
a = 10 - b
*/
