#include <bits/stdc++.h>
using namespace std;
struct Node {
  int l, r, whe;
} s[100100];
struct Point {
  int v, whe;
} a[100100];
int m, q, sqr, R[100100], L[100100];
int cnt[100100], ncol[100100], l, r, ans[100100], tot, tot2;
bool cmp(Node x, Node y) {
  return x.l / sqr < y.l / sqr || (x.l / sqr == y.l / sqr && x.r < y.r);
}
bool cmp2(Point x, Point y) {
  return x.v < y.v || (x.v == y.v && x.whe < y.whe);
}
bool cmp3(Point x, Point y) { return x.whe < y.whe; }
void prep() {
  sort(a + 1, a + m + 1, cmp2);
  for (int i = 1; i <= m; i++) {
    if (a[i].v != a[i - 1].v || a[i].v != a[i - 2].v) {
      L[a[i].whe] = -1;
      R[a[i - 2].whe] = -1;
      continue;
    }
    if (a[i].whe - a[i - 1].whe != a[i - 1].whe - a[i - 2].whe)
      L[a[i].whe] = a[i - 2].whe, R[a[i - 2].whe] = a[i].whe;
    else
      L[a[i].whe] = -1, R[a[i - 2].whe] = -1;
  }
  R[a[m - 1].whe] = -1;
  R[a[m].whe] = -1;
  sort(a + 1, a + m + 1, cmp3);
}
void into(int x) {
  if (!ncol[a[x].v]) tot++;
  ncol[a[x].v]++;
  if (L[x] != -1 && L[x] >= l) {
    if (!cnt[a[x].v]) tot2++;
    cnt[a[x].v]++;
  }
  if (R[x] != -1 && R[x] <= r) {
    if (!cnt[a[x].v]) tot2++;
    cnt[a[x].v]++;
  }
}
void outit(int x) {
  ncol[a[x].v]--;
  if (!ncol[a[x].v]) tot--;
  if (L[x] != -1 && L[x] >= l) {
    cnt[a[x].v]--;
    if (!cnt[a[x].v]) tot2--;
  }
  if (R[x] != -1 && R[x] <= r) {
    cnt[a[x].v]--;
    if (!cnt[a[x].v]) tot2--;
  }
}
void work() {
  l = s[1].l, r = s[1].l - 1;
  for (int i = 1; i <= q; i++) {
    while (l > s[i].l) l--, into(l);
    while (l < s[i].l) outit(l), l++;
    while (r > s[i].r) outit(r), r--;
    while (r < s[i].r) r++, into(r);
    if (tot == 1)
      ans[s[i].whe] = 0;
    else
      ans[s[i].whe] = tot - (tot != tot2);
  }
  for (int i = 1; i <= q; i++) printf("%d\n", ans[i] + 1);
}
int main() {
  cin >> m;
  for (int i = 1; i <= m; i++) scanf("%d", &a[i].v), a[i].whe = i;
  cin >> q;
  for (int i = 1; i <= q; i++) scanf("%d %d", &s[i].l, &s[i].r), s[i].whe = i;
  sqr = sqrt(m);
  sort(s + 1, s + q + 1, cmp);
  prep();
  work();
}
