题号：NC256205
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
Ran feels boring at home, and wants to propose a math problem with Yukari and Chen!
So here's The Yakumo Family Problem:
Given an integer array
, try to calculate the value of the following equation modulo 
:
%5Ctimes%20XOR(l_2%2C%20r_2)%5Ctimes%20XOR(l_3%2C%20r_3))
)
means 
, and 
means bitwise XOR.
So here's The Yakumo Family Problem:
Given an integer array
输入描述:
The first line contains one integer(
), which means the length of
.
The next line contains-th integer means the value of
(
).
输出描述:
One integer, means the value of the equation modulo.