4622: Mishka and Interesting sum米什卡和有趣的总和
内存限制：256 MB
时间限制：2 S
标准输入输出
题目类型：传统
评测方式：文本比较
上传者：
提交：5
通过：3
题目描述
D. Mishka and Interesting sum
time limit per test
3.5 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
米什卡喜欢这个阵列，她立即决定确定它的美丽值，但她太小，无法处理大型阵列。
正因为如此，她邀请你去看她，并要求你处理我的m个询问。
每个查询的处理方式如下：
1、两个整数l和r(1 ≤ l ≤ r ≤ n)指定了-查询段的边界。
2、整数表示在数组段[l,r]出现偶数次的数字写下来。
3、计算写下的整数的XOR和，该值是查询的答案。
因为只有小熊知道数组美的定义，所以你所要做的就是回答每一个问题。
Little Mishka enjoys programming. Since her birthday has just passed, her friends decided to present her with array of non-negative integers a1,a2,...,an of n elements!
Mishka loved the array and she instantly decided to determine its beauty value, but she is too little and can't process large arrays. Right because of that she invited you to visit her and asked you to process m queries.
Each query is processed in the following way:
- Two integers l and r (1≤l≤r≤n) are specified− bounds of query segment.
- Integers, presented in array segment [l,r] (in sequence of integers al,al+1,...,ar) even number of times, are written down.
-
XOR-sum of written down integers is calculated, and this value is the answer for a query. Formally, if integers written down in point 2 are x1,x2,...,xk, then Mishka wants to know the value
, where 
− operator of exclusive bitwise OR.
Input
The first line of the input contains single integer n (1≤n≤1000000)− the number of elements in the array.The second line of the input contains n integers a1,a2,...,an (1≤ai≤109)− array elements.
The third line of the input contains single integer m (1≤m≤1000000)− the number of queries.
Each of the next m lines describes corresponding query by a pair of integers l and r (1≤l≤r≤n)− the bounds of query segment.
Output
Print m non-negative integers− the answers for the queries in the order they appear in the input.
Examples
Input
3 3 7 8 1 1 3
Output
0
Input
7 1 2 1 3 3 2 3 5 4 7 4 5 1 3 1 7 1 5
Output
0 3 1 3 2
Note
In the second sample:There is no integers in the segment of the first query, presented even number of times in the segment− the answer is 0.
In the second query there is only integer 3 is presented even number of times− the answer is 3.
In the third query only integer 1 is written down− the answer is 1.
In the fourth query all array elements are considered. Only 1 and 2 are presented there even number of times. The answer is
.In the fifth query 1 and 3 are written down. The answer is
.
输入格式
输入的第一行包含单个整数n(1 ≤ n ≤ 1 000 000)-阵列中元素的数量。
输入的第二行包含n个整数a1, a2, ..., an (1 ≤ ai ≤ 109)-数组元素。
输入的第三行包含单个整数m(1 ≤ m ≤ 1 000 000)-查询的数量。
接下来的m行中的每一行通过一对整数l和r(1 ≤ l ≤ r ≤ n)-查询段的边界。
输入的第二行包含n个整数a1, a2, ..., an (1 ≤ ai ≤ 109)-数组元素。
输入的第三行包含单个整数m(1 ≤ m ≤ 1 000 000)-查询的数量。
接下来的m行中的每一行通过一对整数l和r(1 ≤ l ≤ r ≤ n)-查询段的边界。
输出格式
打印m个非负整数-按照查询在输入中出现的顺序显示查询的答案。
输入样例 复制
7
1 2 1 3 3 2 3
5
4 7
4 5
1 3
1 7
1 5输出样例 复制
0
3
1
3
2