#include<bits/stdc++.h>
using namespace std;
const int N = 3e6 + 5;
int a[N], n, m, sum[N << 5], ls[N << 5], rs[N << 5];
int b[N], num, pre[N], rt[N];
inline int update(int q, int l, int r, int pos, int w) {
	int p = ++num;
	ls[p] = ls[q];
	rs[p] = rs[q];
	sum[p] = sum[q] + w;
	if (l < r) {
		int mid = (l + r) >> 1;
		if (pos <= mid) ls[p] = update(ls[q], l, mid, pos, w);
		else rs[p] = update(rs[q], mid + 1, r, pos, w);
	}
	return p;
}
int askpos(int p, int l, int r, int pos) {
	if (l == r) return sum[p];
	int mid = (l + r) >> 1;
	if (pos <= mid) return askpos(ls[p], l, mid, pos) + sum[rs[p]];
	else return askpos(rs[p], mid + 1, r, pos);
}
int build(int l, int r) {
	int p = ++num;
	ls[p] = rs[p] = sum[p] = 0;
	if (l == r) return p;
	int mid = (l + r) >> 1;
	ls[p] = build(l, mid);
	rs[p] = build(mid + 1, r);
	return p;
}
void read() {
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
	memset(pre, -1, sizeof pre);
	rt[0] = build(1, n);
	for (int i = 1; i <= n; ++i) {
		int w = a[i];
		if (pre[w] != -1) {
			int t = update(rt[i - 1], 1, n, pre[w], -1);
			rt[i] = update(t, 1, n, i, 1);
		} else {
			rt[i] = update(rt[i - 1], 1, n, i, 1);
		}
		pre[w] = i;
	}
	scanf("%d", &m);
	for (int i = 1; i <= m; ++i) {
		int l, r;
		scanf("%d%d", &l, &r);
		printf("%d\n", askpos(rt[r], 1, n, l));
	}
}
int main() {
	read();
	return 0;
}