#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
vector<int> qs[N];
int b[N], q[N][2];
int s[8 * N], e[8 * N], d[8 * N];
int lastpos, etmp = 0, now, dtmp;
map<int, int> last;
void add(int x, int L, int R, int qx, int qv) {
  if (L == R) {
    s[x] += qv;
    if (qv == -1) {
      etmp = e[x];
      dtmp = d[x];
      e[x] = N;
    } else {
      if (lastpos < 0)
        d[x] = 0;
      else
        d[x] = now - lastpos;
      if (dtmp == now - lastpos || dtmp == 0)
        e[x] = etmp;
      else
        e[x] = lastpos - dtmp + 1;
    }
  } else {
    int M = (L + R) / 2;
    if (qx <= M)
      add(x * 2, L, M, qx, qv);
    else
      add(x * 2 + 1, M + 1, R, qx, qv);
    s[x] = s[x * 2] + s[x * 2 + 1];
    e[x] = min(e[x * 2], e[x * 2 + 1]);
  }
}
int ask(int x, int L, int R, int qx) {
  if (L == R) return s[x];
  int M = (L + R) / 2;
  if (qx <= M)
    return ask(x * 2, L, M, qx) + s[x * 2 + 1];
  else
    return ask(x * 2 + 1, M + 1, R, qx);
}
int askmin(int x, int L, int R, int qx) {
  if (L == R) return e[x];
  int M = (L + R) / 2;
  if (qx <= M)
    return min(askmin(x * 2, L, M, qx), e[x * 2 + 1]);
  else
    return askmin(x * 2 + 1, M + 1, R, qx);
}
void trace(int x, int L, int R) {
  printf("%d: [%d,%d] (%d,%d,%d)\n", x, L, R, s[x], e[x], d[x]);
  if (L == R) return;
  trace(x * 2, L, (L + R) / 2);
  trace(x * 2 + 1, (L + R) / 2 + 1, R);
}
int qans[N];
int main(void) {
  int m, qq;
  scanf("%d", &m);
  for (int i = 1; i <= m; i++) scanf("%d", &b[i]);
  scanf("%d", &qq);
  for (int i = 0; i < qq; i++) {
    scanf("%d%d", &q[i][0], &q[i][1]);
    qs[q[i][1]].push_back(i);
  }
  for (int i = 0; i < 4 * N; i++) e[i] = N;
  for (int i = 1; i <= m; i++) {
    if (last.count(b[i])) {
      int p = last[b[i]];
      etmp = 0;
      dtmp = 0;
      lastpos = p;
      now = i;
      add(1, 1, m, p, -1);
      add(1, 1, m, i, 1);
      last[b[i]] = i;
    } else {
      etmp = 0;
      dtmp = 0;
      lastpos = -10000;
      now = i;
      add(1, 1, m, i, 1);
      last[b[i]] = i;
    }
    for (__typeof((qs[i]).begin()) it = (qs[i]).begin(); it != (qs[i]).end();
         it++) {
      int l = q[*it][0], ans = 0;
      ans = ask(1, 1, m, l) + (askmin(1, 1, m, l) > l);
      qans[*it] = ans;
    }
  }
  for (int i = 0; i < qq; i++) printf("%d\n", qans[i]);
  return 0;
}
