Let's assume that we are given a matrix b of size x × y, let's determine the operation of mirroring matrix b. The mirroring of matrix b is a 2x × y matrix c which has the following properties:

  * the upper half of matrix c (rows with numbers from 1 to x) exactly matches b; 
  * the lower half of matrix c (rows with numbers from x + 1 to 2x) is symmetric to the upper one; the symmetry line is the line that separates two halves (the line that goes in the middle, between rows x and x + 1). 



Sereja has an n × m matrix a. He wants to find such matrix b, that it can be transformed into matrix a, if we'll perform on it several (possibly zero) mirrorings. What minimum number of rows can such matrix contain?

Input

The first line contains two integers, n and m (1 ≤ n, m ≤ 100). Each of the next n lines contains m integers — the elements of matrix a. The i-th line contains integers ai1, ai2, ..., aim (0 ≤ aij ≤ 1) — the i-th row of the matrix a.

Output

In the single line, print the answer to the problem — the minimum number of rows of matrix b.

Examples

Input

4 3
0 0 1
1 1 0
1 1 0
0 0 1


Output

2


Input

3 3
0 0 0
0 0 0
0 0 0


Output

3


Input

8 1
0
1
1
0
0
1
1
0


Output

2

Note

In the first test sample the answer is a 2 × 3 matrix b:
    
    
      
    001  
    110  
    

If we perform a mirroring operation with this matrix, we get the matrix a that is given in the input:
    
    
      
    001  
    110  
    110  
    001  
    
#include <bits/stdc++.h>
using namespace std;
template <typename X>
X gcd(X a, X b) {
  if (!b)
    return a;
  else
    return gcd(b, a % b);
}
int main() {
  int n, m;
  cin >> n >> m;
  int a[n + 1][m + 1];
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> a[i][j];
    }
  }
  int ans;
  if (n % 2)
    ans = n;
  else {
    int x = n;
    x /= 2;
    int k = 0;
    bool flag = true;
    while (flag && x > 0) {
      for (int i = 0, j = 2 * x - 1; i < x && j >= x; i++, j--) {
        flag = true;
        while (k < m) {
          if (a[i][k] == a[j][k])
            k++;
          else {
            flag = false;
            break;
          }
        }
        k = 0;
        if (flag == false) {
          x *= 2;
          break;
        }
      }
      if (flag && x % 2 == 0)
        x /= 2;
      else {
        ans = x;
        break;
      }
    }
  }
  printf("%d\n", ans);
}
