Codeforces Round #365 (Div. 2) D. Mishka and Interesting sum（离线树状数组）

思路：首先在线的我不会做...题目没有修改操作，那么可以考虑离线的做法，考虑到异或有一个性质a^a=0，即出现次数为偶数的话那么异或起来为0，假设有一个序列为1,2,1,3,2的话，如果我查询区间[1,5]，那么可以留意到把这个区间所有的数1^2^1^3^2算出来，然后再异或这个区间的数字1^2^3，那么最后结果就是1^2，恰好就是出现偶数次的数字的异或和，那么就可以预处理出所有的前缀异或和，对询问排个序，然后离线用树状数组搞一搞就可以了

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e6+7;
int a[maxn],sum[maxn],pre[maxn],c[maxn],ans[maxn];
map<int,int>vis;
int lowbit(int x){return x&(-x);}
void update(int i,int num)
{
	while(i<=maxn)
	{
		c[i]^=num;
		i+=lowbit(i);
	}
}
int query(int i)
{
	int ans = 0;
	while(i)
	{
		ans^=c[i];
		i-=lowbit(i);
	}
	return ans;
}
struct Node
{
	int l,r,id;
}q[maxn];
bool cmp(Node a,Node b)
{
	if(a.r==b.r)
		return a.l<b.l;
	return a.r<b.r;
}
int main()
{
    int n;
	scanf("%d",&n);
	for(int i = 1;i<=n;i++)
	{
		scanf("%d",&a[i]);
		sum[i]=sum[i-1]^a[i];
		pre[i]=vis[a[i]];
		vis[a[i]]=i;
	}
	int m;
	scanf("%d",&m);
	for(int i = 1;i<=m;i++)
		scanf("%d%d",&q[i].l,&q[i].r),q[i].id = i;
    sort(q+1,q+1+m,cmp);
    for(int i = 1,r=1;i<=m;i++)
	{
		while(r<=q[i].r)
		{
			if(pre[r])
				update(pre[r],a[r]);
			update(r,a[r]);
			r++;
		}
		ans[q[i].id]=query(q[i].r)^query(q[i].l-1)^sum[q[i].r]^sum[q[i].l-1];
	}
	for(int i = 1;i<=m;i++)
		printf("%d\n",ans[i]);
}

D. Mishka and Interesting sum

time limit per test

3.5 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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:

1. Two integers l and r (1 ≤ l ≤ r ≤ n) are specified — bounds of query segment.
2. Integers, presented in array segment [l,  r] (in sequence of integers al, al + 1, ..., ar) even number of times, are written down.
3. 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.

Since only the little bears know the definition of array beauty, all you are to do is to answer each of queries presented.

Input

The first line of the input contains single integer n (1 ≤ n ≤ 1 000 000) — 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 ≤ 1 000 000) — 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 .