这题 莫队超时了，求助卡常。

#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#pragma GCC optimize(2)
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <cstdio>
using namespace std;

inline int read()
{
	register char ch = getchar();
	register int x = 0;
	while (ch < '0' || ch > '9') ch = getchar();
	while (ch >= '0' && ch <= '9')
	{
		x = (x << 1) + (x << 3) + (ch ^ 48);
		ch = getchar();
	}
	return x;
}

const int N = 1e6 + 5;
int a[N], n, m, len, cnt[N], res = 0, ans[N], b[N];

struct Node
{
	int id, l, r, p;
	bool operator<(const Node& x) const
	{
		if (p != x.p) return p < x.p;
		return (p ^ x.p ? r < x.r : p & 1 ? r < x.r : r > x.r);
	}
}q[N];

inline void add(const register int& x)
{
	if (++cnt[a[x]] >= 2) res ^= b[a[x]];
}

inline void del(const register int& x)
{
	if (--cnt[a[x]] >= 1) res ^= b[a[x]];
}

int main()
{
	n = read();
	for (register int i = 1; i <= n; ++i)
	{
		a[i] = read();
		b[i] = a[i];
	}
	sort(b + 1, b + n + 1);
	register int place = unique(b + 1, b + n + 1) - b - 1;
	for (register int i = 1; i <= n; ++i)
	{
		register int k = a[i];
		a[i] = lower_bound(b + 1, b + place + 1, a[i]) - b;
	}
	m = read();
	len = n / sqrt(m * 0.9);
	for (register int i = 0; i < m; ++i)
	{
		register int l = read(), r = read();
		q[i] = { i, l, r, l / len };
	}
	sort(q, q + m);
	register int nl = q[0].l, nr = q[0].l - 1;
	for (register int i = 0; i < m; ++i)
	{
		register int l = q[i].l, r = q[i].r;
		while (nl < l) del(nl++);
		while (nl > l) add(--nl);
		while (nr < r) add(++nr);
		while (nr > r) del(nr--);
		ans[q[i].id] = res;
	}
	for (register int i = 0; i < m; ++i) printf("%d\n", ans[i]);
	return 0;
}