#include <bits/stdc++.h>
using namespace std;
void solve();
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  solve();
}
template <class T = int>
inline T readInt();
inline double readDouble();
inline int readUInt();
inline int readChar();
inline void readWord(char *s);
inline bool readLine(char *s);
inline bool isEof();
inline int getChar();
inline int peekChar();
inline bool seekEof();
inline void skipBlanks();
template <class T>
inline void writeInt(T x, char end = 0, int len = -1);
inline void writeChar(int x);
inline void writeWord(const char *s);
inline void writeDouble(double x, int len = 0);
inline void flush();
static struct buffer_flusher_t {
  ~buffer_flusher_t() { flush(); }
} buffer_flusher;
static const int buf_size = 4096;
static unsigned char buf[buf_size];
static int buf_len = 0, buf_pos = 0;
inline bool isEof() {
  if (buf_pos == buf_len) {
    buf_pos = 0, buf_len = fread(buf, 1, buf_size, stdin);
    if (buf_pos == buf_len) return 1;
  }
  return 0;
}
inline int getChar() { return isEof() ? -1 : buf[buf_pos++]; }
inline int peekChar() { return isEof() ? -1 : buf[buf_pos]; }
inline bool seekEof() {
  int c;
  while ((c = peekChar()) != -1 && c <= 32) buf_pos++;
  return c == -1;
}
inline void skipBlanks() {
  while (!isEof() && buf[buf_pos] <= 32U) buf_pos++;
}
inline int readChar() {
  int c = getChar();
  while (c != -1 && c <= 32) c = getChar();
  return c;
}
inline int readUInt() {
  int c = readChar(), x = 0;
  while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = getChar();
  return x;
}
template <class T>
inline T readInt() {
  int s = 1, c = readChar();
  T x = 0;
  if (c == '-')
    s = -1, c = getChar();
  else if (c == '+')
    c = getChar();
  while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = getChar();
  return s == 1 ? x : -x;
}
inline double readDouble() {
  int s = 1, c = readChar();
  double x = 0;
  if (c == '-') s = -1, c = getChar();
  while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = getChar();
  if (c == '.') {
    c = getChar();
    double coef = 1;
    while ('0' <= c && c <= '9') x += (c - '0') * (coef *= 1e-1), c = getChar();
  }
  return s == 1 ? x : -x;
}
inline void readWord(char *s) {
  int c = readChar();
  while (c > 32) *s++ = c, c = getChar();
  *s = 0;
}
inline bool readLine(char *s) {
  int c = getChar();
  while (c != '\n' && c != -1) *s++ = c, c = getChar();
  *s = 0;
  return c != -1;
}
static int write_buf_pos = 0;
static char write_buf[buf_size];
inline void writeChar(int x) {
  if (write_buf_pos == buf_size)
    fwrite(write_buf, 1, buf_size, stdout), write_buf_pos = 0;
  write_buf[write_buf_pos++] = x;
}
inline void flush() {
  if (write_buf_pos)
    fwrite(write_buf, 1, write_buf_pos, stdout), write_buf_pos = 0;
}
template <class T>
inline void writeInt(T x, char end, int output_len) {
  if (x < 0) writeChar('-'), x = -x;
  char s[24];
  int n = 0;
  while (x || !n) s[n++] = '0' + x % 10, x /= 10;
  while (n < output_len) s[n++] = '0';
  while (n--) writeChar(s[n]);
  if (end) writeChar(end);
}
inline void writeWord(const char *s) {
  while (*s) writeChar(*s++);
}
inline void writeDouble(double x, int output_len) {
  if (x < 0) writeChar('-'), x = -x;
  int t = (int)x;
  writeInt(t), x -= t;
  writeChar('.');
  for (int i = output_len - 1; i > 0; i--) {
    x *= 10;
    t = std::min(9, (int)x);
    writeChar('0' + t), x -= t;
  }
  x *= 10;
  t = std::min(9, (int)(x + 0.5));
  writeChar('0' + t);
}
const int MAXN = (int)5e5 + 7;
int n, k;
vector<int> a;
const int K = 1400;
int ex[MAXN * 80], exsz = 0;
bool inds[MAXN];
struct DS {
  int cnt[MAXN];
  int curl, curr;
  inline void init() {
    curl = 0;
    curr = 0;
    cnt[a[0]] = 1;
    if (cnt[a[0]] == k)
      if (!inds[a[0]]) ex[exsz++] = a[0], inds[a[0]] = true;
  }
  inline void add(int val) {
    cnt[val]++;
    if (cnt[val] == k)
      if (!inds[val]) ex[exsz++] = val, inds[val] = true;
  }
  inline void del(int val) {
    cnt[val]--;
    if (cnt[val] == k)
      if (!inds[val]) ex[exsz++] = val, inds[val] = true;
  }
  inline int get() {
    while (exsz > 0) {
      if (cnt[ex[exsz - 1]] != k) {
        inds[ex[exsz - 1]] = false;
        exsz--;
      } else
        return ex[exsz - 1];
    }
    return -1;
  }
};
DS to_ans;
bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
  if (a.first.first / K == b.first.first / K) {
    if ((a.first.first / K) % 2 == 0)
      return a.first.second < b.first.second;
    else
      return b.first.second < a.first.second;
  }
  return make_pair(a.first.first / K, a.first.second) <
         make_pair(b.first.first / K, b.first.second);
}
void solve() {
  n = readInt();
  k = 1ll;
  a.resize(n);
  for (int(i) = 0; (i) < (n); ++(i)) a[i] = readInt();
  int q;
  q = readInt();
  vector<pair<pair<int, int>, int>> qs(q);
  for (int(i) = 0; (i) < (q); ++(i)) {
    qs[i].first.first = readInt();
    qs[i].first.second = readInt();
    qs[i].first.first--;
    qs[i].first.second--;
    qs[i].second = i;
  }
  vector<int> cors;
  for (auto i : a) cors.push_back(i);
  sort((cors).begin(), (cors).end());
  cors.resize(unique((cors).begin(), (cors).end()) - cors.begin());
  for (int(i) = 0; (i) < (n); ++(i))
    a[i] = lower_bound((cors).begin(), (cors).end(), a[i]) - cors.begin();
  vector<int> ans(q);
  sort((qs).begin(), (qs).end(), cmp);
  int curl = 0, curr = 0;
  to_ans.init();
  for (auto qwe : qs) {
    int l = qwe.first.first, r = qwe.first.second;
    int i = qwe.second;
    while (l < curl) to_ans.add(a[--curl]);
    while (curr < r) to_ans.add(a[++curr]);
    while (curl < l) to_ans.del(a[curl++]);
    while (r < curr) to_ans.del(a[curr--]);
    ans[i] = to_ans.get();
  }
  for (auto i : ans) {
    if (i == -1) {
      writeInt(0);
      writeChar('\n');
    } else {
      writeInt(cors[i]);
      writeChar('\n');
    }
  }
}
