CodeForces - 202C Clear Symmetry （预处理模拟+找规律）

Consider some square matrix A with side n consisting of zeros and ones. There aren rows numbered from 1 to n from top to bottom and n columns numbered from 1 to nfrom left to right in this matrix. We'll denote the element of the matrix which is located at the intersection of the i-row and the j-th column as A_i, j.

Let's call matrix A clear if no two cells containing ones have a common side.

Let's call matrix A symmetrical if it matches the matrices formed from it by a horizontal and/or a vertical reflection. Formally, for each pair (i, j) (1 ≤ i, j ≤ n) both of the following conditions must be met: A_i, j = A_{n - i + 1, j} and A_i, j = A_{i, n - j + 1}.