A9429. Unusual Product

The first line of input contains an integer $n$ ( $1<=n<=1000$ ), the number of rows and the number of columns in the matrix $A$ . The next $n$ lines describe the matrix: the $i$ -th line contains $n$ space-separated bits and describes the $i$ -th row of $A$ . The $j$ -th number of the $i$ -th line $a_{ij}$ ( $0<=a_{ij}<=1$ ) is the element on the intersection of the $i$ -th row and the $j$ -th column of $A$ .

The next line of input contains an integer $q$ ( $1<=q<=10^{6}$ ), the number of queries. Each of the next $q$ lines describes a single query, which can be one of the following:

- 1 $i$ — flip the values of the $i$ -th row;
- 2 $i$ — flip the values of the $i$ -th column;
- 3 — output the unusual square of $A$ .

Note: since the size of the input and output could be very large, don't use slow output techniques in your language. For example, do not use input and output streams (cin, cout) in C++.

Let the number of the 3rd type queries in the input be $m$ . Output a single string $s$ of length $m$ , where the $i$ -th symbol of $s$ is the value of the unusual square of $A$ for the $i$ -th query of the 3rd type as it appears in the input.

无