XOR on Segment

Description:

Input:

The first line contains integer n (1 ≤ n ≤ 10⁵) — the size of the array. The second line contains space-separated integers a₁, a₂, ..., a_n (0 ≤ a_i ≤ 10⁶) — the original array.

The third line contains integer m (1 ≤ m ≤ 5·10⁴) — the number of operations with the array. The i-th of the following m lines first contains an integer t_i (1 ≤ t_i ≤ 2) — the type of the i-th query. If t_i = 1, then this is the query of the sum, if t_i = 2, then this is the query to change array elements. If the i-th operation is of type 1, then next follow two integers l_i, r_i (1 ≤ l_i ≤ r_i ≤ n). If the i-th operation is of type 2, then next follow three integers l_i, r_i, x_i (1 ≤ l_i ≤ r_i ≤ n, 1 ≤ x_i ≤ 10⁶). The numbers on the lines are separated by single spaces.

Output:

For each query of type 1 print in a single line the sum of numbers on the given segment. Print the answers to the queries in the order in which the queries go in the input.

Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams, or the %I64d specifier.

Sample Input:

5
4 10 3 13 7
8
1 2 4
2 1 3 3
1 2 4
1 3 3
2 2 5 5
1 1 5
2 1 2 10
1 2 3

Sample Output:

26
22
0
34
11

Sample Input:

6
4 7 4 0 7 3
5
2 2 3 8
1 1 5
2 3 5 1
2 4 5 6
1 2 3

Sample Output:

38
28