A sequence $A_1, A_2, \ldots, A_N$ of length $N$ is given. Write a program to execute the following queries:

• 1 i x: Change $A_i$ to $x$.
• 2 l r: Output the number of even numbers among $A_i$ that satisfy $l \le i \le r$.
• 3 l r: Output the number of odd numbers among $A_i$ that satisfy $l \le i \le r$.

The indices of the sequence start from 1.

Input

The first line contains the length $N$ of the sequence $(1 \le N \le 100{,}000)$.

The second line contains $A_1, A_2, \ldots, A_N$ $(1 \le A_i \le 10^9)$.

The third line contains the number of queries $M$ $(1 \le M \le 100{,}000)$.

The next $M$ lines each contain a query $(1 \le i \le N, 1 \le l \le r \le N, 1 \le x \le 10^9)$.

Output

For each query of type 2 and type 3, output its answer on a separate line.

Examples

Example Input 1

6
1 2 3 4 5 6
4
2 2 5
3 1 4
1 5 4
2 1 6

Example Output 1

2
2
4