#include <bits/stdc++.h>
using namespace std;
int inf_int = 2e9;
long long inf_ll = 2e18;
const double pi = 3.1415926535898;
template <typename T, typename T1>
void prin(vector<pair<T, T1> >& a) {
  for (int i = 0; i < a.size(); i++) {
    cout << a[i].first << " " << a[i].second << "\n";
  }
}
template <typename T, typename T1>
void prin(set<pair<T, T1> >& a) {
  for (auto it = a.begin(); it != a.end(); it++) {
    cout << it->first << " " << it->second << "\n";
  }
}
template <typename T>
void prin(vector<T>& a) {
  for (int i = 0; i < a.size(); i++) {
    cout << a[i];
    if (i < a.size() - 1)
      cout << " ";
    else
      cout << "\n";
  }
}
template <typename T>
void prin(set<T>& a) {
  for (auto it = a.begin(); it != a.end(); it++) {
    cout << *it << " ";
  }
}
template <typename T>
void prin_new_line(vector<T>& a) {
  for (int i = 0; i < a.size(); i++) {
    cout << a[i] << "\n";
  }
}
template <typename T, typename T1>
void prin_new_line(vector<pair<T, T1> >& a) {
  for (int i = 0; i < a.size(); i++) {
    cout << a[i].first << " " << a[i].second << "\n";
  }
}
int sum_vec(vector<int>& a) {
  int s = 0;
  for (int i = 0; i < a.size(); i++) {
    s += a[i];
  }
  return s;
}
template <typename T>
T max(vector<T>& a) {
  T ans = a[0];
  for (int i = 1; i < a.size(); i++) {
    ans = max(ans, a[i]);
  }
  return ans;
}
template <typename T>
T min(vector<T>& a) {
  T ans = a[0];
  for (int i = 1; i < a.size(); i++) {
    ans = min(ans, a[i]);
  }
  return ans;
}
template <typename T>
T min(T a, T b, T c) {
  return min(a, min(b, c));
}
template <typename T>
T max(T a, T b, T c) {
  return max(a, max(b, c));
}
long double s_triangle(long double x1, long double y1, long double x2,
                       long double y2, long double x3, long double y3) {
  return abs(((x2 - x1) * (y3 - y1) - (x3 - x1) * (y2 - y1)) / 2);
}
bool overflow(long long a, long long b) {
  if (a * b / b != a) return true;
  return false;
}
bool debug = 0;
const int maxn = 1e6 + 100;
long long mod = 1e9 + 7;
int t[4 * maxn];
void update(int v, int tl, int tr, int pos, int val) {
  if (tl == tr) {
    t[v] = val;
  } else {
    int tm = (tl + tr) >> 1;
    if (pos <= tm) {
      update(v << 1, tl, tm, pos, val);
    } else {
      update(v << 1 | 1, tm + 1, tr, pos, val);
    }
    t[v] = t[v << 1] ^ t[v << 1 | 1];
  }
}
int get(int v, int tl, int tr, int l, int r) {
  if (l > r) return 0;
  if (tl == l && tr == r) return t[v];
  int tm = (tl + tr) >> 1;
  return get(v << 1, tl, tm, l, min(r, tm)) ^
         get(v << 1 | 1, tm + 1, tr, max(tm + 1, l), r);
}
int pref[maxn];
int ans[maxn];
void solve() {
  int n;
  scanf("%d", &n);
  int a[n + 1];
  for (int i = 1; i <= n; i++) {
    int x;
    scanf("%d", &x);
    a[i] = x;
  }
  for (int i = 1; i <= n; i++) {
    pref[i] = pref[i - 1] ^ a[i];
  }
  int q;
  scanf("%d", &q);
  vector<pair<pair<int, int>, int> > c;
  for (int i = 0; i < q; i++) {
    int l, r;
    scanf("%d %d", &l, &r);
    c.push_back({{r, l}, i});
  }
  sort(c.begin(), c.end());
  int top = 0;
  map<int, int> mp;
  for (int i = 0; i < c.size(); i++) {
    int l = c[i].first.second;
    int r = c[i].first.first;
    int ind = c[i].second;
    while (top < r) {
      top++;
      int x = a[top];
      if (mp[x] > 0) {
        update(1, 1, n, mp[x], 0);
        mp[x] = top;
        update(1, 1, n, top, a[top]);
      } else {
        mp[x] = top;
        update(1, 1, n, top, a[top]);
      }
    }
    ans[ind] = get(1, 1, n, l, r) ^ (pref[r] ^ pref[l - 1]);
  }
  for (int i = 0; i < q; i++) {
    printf("%d\n", ans[i]);
  }
}
int main() {
  if (!debug) {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
  }
  int t = 1;
  while (t--) solve();
  return 0;
}
