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;
struct segtree {
  vector<int> d;
  int h, n;
  segtree(int sz) {
    h = sizeof(int) * 8 - __builtin_clz(sz);
    n = 1 << h;
    d = vector<int>(n << 1, 0);
  }
  void update(int l, int r, int val) {
    for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
      if (l % 2) d[l++] += val;
      if (r % 2) d[--r] += val;
    }
  }
  int query(int i) {
    int sm = 0;
    for (i += n; i > 0; i /= 2) sm += d[i];
    return sm;
  }
};
struct qry {
  int l, r, ind;
  bool operator<(const qry& o) const { return l > o.l; }
};
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int M, Q;
  cin >> M;
  vector<int> b(M);
  for (int i = 0; i < M; ++i) cin >> b[i];
  cin >> Q;
  vector<qry> q(Q);
  vector<bool> fnda(Q, false), fndb(Q, false);
  for (int i = 0; i < Q; ++i) {
    cin >> q[i].l >> q[i].r;
    --q[i].l;
    --q[i].r;
    q[i].ind = i;
    fnda[i] = true;
  }
  sort(q.begin(), q.end());
  segtree ncol(M), nseq(M);
  vector<int> nxt(M, -1);
  map<int, int> mp;
  for (int i = M - 1; i >= 0; --i) {
    if (mp.count(b[i]) != 0) nxt[i] = mp[b[i]];
    mp[b[i]] = i;
  }
  vector<int> lastValid(1e5 + 5, M);
  vector<int> answers(Q);
  int qit = 0;
  for (int i = M - 1; i >= 0; --i) {
    if (nxt[i] == -1) {
      ncol.update(i, M, 1);
      nseq.update(i, M, 1);
    } else {
      ncol.update(nxt[i], M, -1);
      ncol.update(i, M, 1);
      nseq.update(nxt[i], M, -1);
      nseq.update(i, M, 1);
      if (nxt[nxt[i]] != -1) {
        if (nxt[i] - i != nxt[nxt[i]] - nxt[i]) {
          nseq.update(nxt[nxt[i]], lastValid[b[i]], -1);
          lastValid[b[i]] = nxt[nxt[i]];
        }
      }
    }
    for (; qit < Q && q[qit].l == i; ++qit) {
      answers[q[qit].ind] = ncol.query(q[qit].r) + (nseq.query(q[qit].r) == 0);
    }
  }
  for (int i = 0; i < Q; ++i) {
    cout << answers[i] << endl;
  }
  return 0;
}
