Problem: Note the unusual memory limit.

For a rectangular grid where each square is painted white or black, we define its complexity as follows:

* If all the squares are black or all the squares are white, the complexity is 0.
* Otherwise, divide the grid into two subgrids by a line parallel to one of the sides of the grid, and let c_1 and c_2 be the complexities of the subgrids. There can be multiple ways to perform the division, and let m be the minimum value of \max(c_1, c_2) in those divisions. The complexity of the grid is m+1.



You are given a grid with H horizontal rows and W vertical columns where each square is painted white or black. HW characters from A_{11} to A_{HW} represent the colors of the squares. A_{ij} is `#` if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is `.` if that square is white.

Find the complexity of the given grid.

Constraints

* 1 \leq H,W \leq 185
* A_{ij} is `#` or `.`.

Input

Input is given from Standard Input in the following format:


H W
A_{11}A_{12}...A_{1W}
:
A_{H1}A_{H2}...A_{HW}


Output

Print the complexity of the given grid.

Examples

Input

3 3
...
.##
.##


Output

2


Input

6 7
.####.#
....#.
....#.
....#.
.####.#
....##


Output

4

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 190;
int n, m;
char a[N][N];
int o;
int f[2][N][N][N];
int main() { 
	cin >> n >> m;
	for(int i = 1; i <= n; i++) scanf("%s", a[i] + 1);
	for(int j = m; j; j--) {
		for(int i = 1; i <= n; i++) {
			for(int k = i; k <= n; k++) if(a[k][j] == a[i][j]) {
				f[o][j][i][k] = j;
				if (a[i][j] == a[i][j + 1]) {
					f[o][j][i][k] = max(j, f[o][j + 1][i][k]);
				}
			} else break;
		}
	}
	for(int ans = 0; ans <= 20; ans++) {
		if (f[o][1][1][n] == m) {
			printf("%d\n", ans); return 0;
		}
		memset(f[1 - o], 0, sizeof f[1 - o]);
		for(int j = 1; j <= m; j++) {
			for(int i = 1; i <= n; i++) {
				for(int z = i; z <= n; z++) {
					if(ans == 1 && j == 1 && i == 1 && z == n) {
						int kkk = j;
					}
					int g = f[o][j][i][z];
					if (f[o][j][i][z] > 0 && f[o][j][i][z] < m)
						g = max(g, f[o][ f[o][j][i][z] + 1 ][i][z]);
					if (i != z) {
						int l = i, r = z - 1, ret = l;
						while (l <= r) {
							int mid = l + r >> 1;
							if (f[o][j][i][mid] >= f[o][j][mid + 1][z]) {
								ret = mid, l = mid + 1;
							} else r = mid - 1;
						}
						g = max(g, min(f[o][j][i][ret], f[o][j][ret + 1][z]));
						ret ++;
						if (ret < z)
							g = max(g, min(f[o][j][i][ret], f[o][j][ret + 1][z]));
					}
					f[1 - o][j][i][z] = g;
				}
			}
		}
		o = 1 - o;
	}
}