D-Ama no Jaku_2026牛客五一集训派对day1

时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
Special Judge, 64bit IO Format: %lld

题目描述

Let me tell you the things that I have been thinking for a long time.

You are given an $n\times n$ matrix $A$ with each number in $A$ either $0$ or $1$ .

You can do the following operation on $A$ any number of times (possibly zero):

Choose a row or a column from $A$ , and flip it (i.e. all the $0$ s in that row or column become $1$ s, and all the $1$ s become $0$ s).

Define $r_i$ as $(\overline{A_{i1}A_{i2}\dots A_{in}})_2$ , which means writing all the number in the $i$ -th row from left to right, forming a binary number $r_i$ .

Define $c_j$ as $(\overline{A_{1j}A_{2j}\dots A_{nj}})_2$ , which means writing all the number in the $j$ -th column from top to bottom, forming a binary number $c_j$ .