Narang gave a problem to his friend, Arora. Narang gave Arora an integer array A of size N, Arora needs to perform 2 operations over this array :

1. $0\space L \space R$ : Find and print $A[L]$ xor $A[L+1]$ xor $A[L+2]$ ... xor $A[R]$

2. $1 \space X \space Y$ : Set the $X^{th}$ elements of array A to value Y.

Arora being a commerce student could not code the problem.

Can you help Arora code this simple problem?

Input Format :

The first line contains a single integer N denoting the size of array A. The next line contains N space separated integers, where the $i^{th}$ element denotes $A[i]$. The third line contains the number of operations Q and then each of the remaining Q lines contain three space separated integers, where the $i^{th}$ line denotes the parameters of the $i^{th}$ query.

Output Format :

For each operation of the form $0 \space L \space R$, display the answer for the operation in a separate line.

Input Constraints:

$1 \le N \le 10^6$

$1 \le Q \le 10^5$

$0 \le A[i] \le 10^6$

$1 \le L \le R \le N$

$1 \le X \le N$

$1 \le Y \le 10^6$