Cosider a sequence, consisting of n integers: a1, a2, ..., an. Jeff can perform the following operation on sequence a:

  * take three integers v, t, k (1 ≤ v, t ≤ n; 0 ≤ k; v + tk ≤ n), such that av = av + t, av + t = av + 2t, ..., av + t(k - 1) = av + tk; 
  * remove elements av, av + t, ..., av + t·k from the sequence a, the remaining elements should be reindexed a1, a2, ..., an - k - 1. 
  * permute in some order the remaining elements of sequence a. 



A beauty of a sequence a is the minimum number of operations that is needed to delete all elements from sequence a.

Jeff's written down a sequence of m integers b1, b2, ..., bm. Now he wants to ask q questions. Each question can be described with two integers li, ri. The answer to the question is the beauty of sequence bli, bli + 1, ..., bri. You are given the sequence b and all questions. Help Jeff, answer all his questions.

Input

The first line contains integer m (1 ≤ m ≤ 105). The next line contains m integers b1, b2, ..., bm (1 ≤ bi ≤ 105). 

The third line contains integer q (1 ≤ q ≤ 105) — the number of questions. The next q lines contain pairs of integers, i-th of them contains a pair of integers li, ri (1 ≤ li ≤ ri ≤ m) — the description of i-th question.

Output

In q lines print the answers to Jeff's queries. Print the answers according to the order of questions in input.

Examples

Input

5
2 2 1 1 2
5
1 5
1 1
2 2
1 3
2 3


Output

2
1
1
2
2


Input

10
2 1 3 3 3 3 1 3 1 1
10
4 8
2 10
1 10
4 4
1 3
2 4
6 7
1 9
2 5
1 1


Output

2
3
3
1
3
2
2
3
2
1
#include <bits/stdc++.h>
using namespace std;
int n, a[100010], m;
int SIZE;
struct node {
  int l, r, id;
} q[100010];
int cnt[100010] = {0}, curans = 0, An[100010];
int OK = 0, ok[100010] = {0}, di[100010] = {0};
deque<int> Q[100010];
int cmp(const node &a, const node &b) {
  if (a.l / SIZE == b.l / SIZE) return a.r < b.r;
  return a.l / SIZE < b.l / SIZE;
}
void addone(int x) {
  if (++cnt[a[x]] == 1) ++curans;
}
void delone(int x) {
  if (--cnt[a[x]] == 0) --curans;
}
void add_front(int x) {
  if (Q[a[x]].size() <= 1) {
    Q[a[x]].push_front(x);
  } else {
    int tmp = Q[a[x]].front();
    Q[a[x]].pop_front();
    int tmp2 = Q[a[x]].front();
    Q[a[x]].push_front(tmp);
    Q[a[x]].push_front(x);
    if (tmp - x != tmp2 - tmp) di[a[x]]++;
  }
  if (di[a[x]] == 0 && cnt[a[x]] > 0) {
    if (!ok[a[x]]) ok[a[x]] = 1, OK++;
  } else {
    if (ok[a[x]]) ok[a[x]] = 0, OK--;
  }
}
void add_tail(int x) {
  if (Q[a[x]].size() <= 1) {
    Q[a[x]].push_back(x);
  } else {
    int tmp = Q[a[x]].back();
    Q[a[x]].pop_back();
    int tmp2 = Q[a[x]].back();
    Q[a[x]].push_back(tmp);
    Q[a[x]].push_back(x);
    if (x - tmp != tmp - tmp2) di[a[x]]++;
  }
  if (di[a[x]] == 0 && cnt[a[x]] > 0) {
    if (!ok[a[x]]) ok[a[x]] = 1, OK++;
  } else {
    if (ok[a[x]]) ok[a[x]] = 0, OK--;
  }
}
void del_front(int x) {
  if (Q[a[x]].size() <= 2) {
    Q[a[x]].pop_front();
  } else {
    int tmp = Q[a[x]].front();
    Q[a[x]].pop_front();
    int tmp2 = Q[a[x]].front();
    Q[a[x]].pop_front();
    int tmp3 = Q[a[x]].front();
    Q[a[x]].push_front(tmp2);
    if (tmp2 - tmp != tmp3 - tmp2) di[a[x]]--;
  }
  if (di[a[x]] == 0 && cnt[a[x]] > 0) {
    if (!ok[a[x]]) ok[a[x]] = 1, OK++;
  } else {
    if (ok[a[x]]) ok[a[x]] = 0, OK--;
  }
}
void del_tail(int x) {
  if (Q[a[x]].size() <= 2) {
    Q[a[x]].pop_back();
  } else {
    int tmp = Q[a[x]].back();
    Q[a[x]].pop_back();
    int tmp2 = Q[a[x]].back();
    Q[a[x]].pop_back();
    int tmp3 = Q[a[x]].back();
    Q[a[x]].push_back(tmp2);
    if (tmp - tmp2 != tmp2 - tmp3) di[a[x]]--;
  }
  if (di[a[x]] == 0 && cnt[a[x]] > 0) {
    if (!ok[a[x]]) ok[a[x]] = 1, OK++;
  } else {
    if (ok[a[x]]) ok[a[x]] = 0, OK--;
  }
}
int main() {
  scanf("%d", &n);
  for (; SIZE * SIZE < n; SIZE++)
    ;
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  scanf("%d", &m);
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &q[i].l, &q[i].r);
    q[i].id = i;
  }
  sort(q + 1, q + m + 1, cmp);
  int l = 1, r = 1;
  addone(1);
  add_tail(1);
  for (int i = 1; i <= m; i++) {
    for (int j = r + 1; j <= q[i].r; j++) addone(j), add_tail(j);
    for (int j = l - 1; j >= q[i].l; j--) addone(j), add_front(j);
    for (int j = l; j < q[i].l; j++) delone(j), del_front(j);
    for (int j = r; j > q[i].r; j--) delone(j), del_tail(j);
    An[q[i].id] = curans + (OK == 0);
    l = q[i].l;
    r = q[i].r;
  }
  for (int i = 1; i <= m; i++) printf("%d\n", An[i]);
  return 0;
}
