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, m, i, j, x, y, lst[100005], nxt[100005], lst2[100005], a[100005],
    ans[100005], arr[100005], arr2[100005];
vector<pair<int, int> > qu[100005];
int lowbit(int x) { return x & (-x); }
void add(int x, int y) {
  int i;
  for (i = x; i > 0; i -= lowbit(i)) arr[i] += y;
}
int query(int x) {
  int i, s = 0;
  for (i = x; i <= 100000; i += lowbit(i)) s += arr[i];
  return s;
}
void add2(int x, int y) {
  int i;
  for (i = x; i > 0; i -= lowbit(i)) arr2[i] += y;
}
int query2(int x) {
  int i, s = 0;
  for (i = x; i <= 100000; i += lowbit(i)) s += arr2[i];
  return s;
}
int main() {
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
    nxt[i] = lst[a[i]];
    lst[a[i]] = i;
    if (i - nxt[i] == nxt[i] - nxt[nxt[i]]) {
      lst2[i] = lst2[nxt[i]];
    } else
      lst2[i] = nxt[nxt[i]];
  }
  cin >> m;
  for (i = 1; i <= m; i++) {
    cin >> x >> y;
    qu[y].push_back(make_pair(i, x));
  }
  for (i = 1; i <= n; i++) {
    if (nxt[i]) {
      add(nxt[i], -1);
      add2(lst2[nxt[i]], 1);
      add2(nxt[i], -1);
    }
    add(i, 1);
    add2(lst2[i], -1);
    add2(i, 1);
    for (j = 0; j < qu[i].size(); j++) {
      ans[qu[i][j].first] =
          query(qu[i][j].second) + (query2(qu[i][j].second) == 0);
    }
  }
  for (i = 1; i <= m; i++) cout << ans[i] << endl;
  return 0;
}
