output_description: Print the number of the ways to choose integers A and B ( 0 \leq A, B < N )
  such that the second board is a good board.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      S_{1,1}S_{1,2}..S_{1,N}
      S_{2,1}S_{2,2}..S_{2,N}
      :
      S_{N,1}S_{N,2}..S_{N,N}
attempt: n = int(input())
  s = [input() for i in range(n)]
  
  
  def check
  
  def yoi(s, b):
    for i in range(n):
      for j in range(i+1, n):
        if s[i % n][(j + b) % n] != s[j % n][(i + b) % n]:
          return 0
    return 1
  
  sol = sum(yoi(s, b) for b in range(n))
  print(sol * n)
problem_description: Statement
  
  Snuke has two boards, each divided into a grid with N rows and N columns. For
  both of these boards, the square at the i-th row from the top and the j-th
  column from the left is called Square (i,j).
  
  There is a lowercase English letter written in each square on the first board.
  The letter written in Square (i,j) is S_{i,j}. On the second board, nothing is
  written yet.
  
  Snuke will write letters on the second board, as follows:
  
    * First, choose two integers A and B ( 0 \leq A, B < N ).
    * Write one letter in each square on the second board. Specifically, write the letter written in Square ( i+A, j+B ) on the first board into Square (i,j) on the second board. Here, the k-th row is also represented as the (N+k)-th row, and the k-th column is also represented as the (N+k)-th column.
  
  After this operation, the second board is called a _good_ board when, for
  every i and j ( 1 \leq i, j \leq N ), the letter in Square (i,j) and the
  letter in Square (j,i) are equal.
  
  Find the number of the ways to choose integers A and B ( 0 \leq A, B < N )
  such that the second board is a good board.
samples: [{"input": "2\n    ab\n    ca", "output": "2\n    \n\nFor each pair of A and B, the second board will look as shown below:\n\n![](https://img.atcoder.jp/agc023/2414e26dc3abb6dd7bfa0c800bb4af0c.png)\n\nThe second board is a good board when (A,B) = (0,1) or (A,B) = (1,0), thus the\nanswer is 2.\n\n* * *"}, {"input": "4\n    aaaa\n    aaaa\n    aaaa\n    aaaa", "output": "16\n    \n\nEvery possible choice of A and B makes the second board good.\n\n* * *"}, {"input": "5\n    abcde\n    fghij\n    klmno\n    pqrst\n    uvwxy", "output": "0\n    \n\nNo possible choice of A and B makes the second board good."}]