#include <bits/stdc++.h>
using namespace std;

template<class T> ostream &operator <<(ostream &os, const vector<T> &v) { for (T x : v) os << x << " "; return os; }

struct BIT {
	vector<long long> bit;

	BIT(int n) : bit(n) {}

	void update(int k, long long v) {
		for (k++; k < bit.size(); k += k & -k) {
			bit[k] += v;
		}
	}

	long long query(int k) {
		long long res = 0;
		for (k++; k > 0; k -= k & -k) {
			res += bit[k];
		}
		return res;
	}
};

const int N = 1 << 18;
vector<int> seg[N * 2];

void build() {
	for (int i = N - 2; i >= 0; i--) {
		seg[i].resize(seg[i * 2 + 1].size() + seg[i * 2 + 2].size());
		merge(seg[i * 2 + 1].begin(), seg[i * 2 + 1].end(), seg[i * 2 + 2].begin(), seg[i * 2 + 2].end(), seg[i].begin());
	}
}

// [:v]
long long query(int a, int b, int v, int k = 0, int l = 0, int r = N) {
	if (r <= a || b <= l) return 0;
	if (a <= l && r <= b) return upper_bound(seg[k].begin(), seg[k].end(), v) - seg[k].begin();
	long long L = query(a, b, v, k * 2 + 1, l, (l + r) / 2);
	long long R = query(a, b, v, k * 2 + 2, (l + r) / 2, r);
	return L + R;
}

// [v:]
long long query2(int a, int b, int v, int k = 0, int l = 0, int r = N) {
	if (r <= a || b <= l) return 0;
	if (a <= l && r <= b) return seg[k].end() - lower_bound(seg[k].begin(), seg[k].end(), v);
	long long L = query2(a, b, v, k * 2 + 1, l, (l + r) / 2);
	long long R = query2(a, b, v, k * 2 + 2, (l + r) / 2, r);
	return L + R;
}

int main() {
	int n;
	cin >> n;

	vector<int> a(n);
	for (int i = 0; i < n; i++) scanf("%d", &a[i]);

	vector<int> A(a);
	int Q;
	cin >> Q;
	vector<int> ll(Q), rr(Q);
	for (int i = 0; i < Q; i++) {
		scanf("%d %d", &ll[i], &rr[i]);
		A.push_back(ll[i]);
		A.push_back(rr[i]);
	}

	sort(A.begin(), A.end());
	A.erase(unique(A.begin(), A.end()), A.end());
	for (int i = 0; i < n; i++) a[i] = lower_bound(A.begin(), A.end(), a[i]) - A.begin();
	for (int i = 0; i < Q; i++) {
		ll[i] = lower_bound(A.begin(), A.end(), ll[i]) - A.begin();
		rr[i] = lower_bound(A.begin(), A.end(), rr[i]) - A.begin();
	}
	for (int i = 0; i < n; i++) {
		seg[i + N - 1].push_back(a[i]);
	}
	build();

	vector<long long> L(A.size() + 2), R(A.size() + 2);
	for (int i = 0; i < n; i++) R[a[i]]++;
	BIT bit(A.size() + 10);

	vector<long long> cnt(A.size() + 2);

	for (int i = 0; i < n; i++) {
		bit.update(a[i], -R[a[i]] * L[a[i]]);
		R[a[i]]--;
		bit.update(a[i], R[a[i]] * L[a[i]]);

		long long s = bit.query(a[i] - 1);
		long long S = bit.query(bit.bit.size() - 2) - bit.query(a[i]);
		cnt[a[i]] += -s + query(0, i, a[i] - 1) * query(i + 1, N, a[i] - 1);
		cnt[a[i]] += -S + query2(0, i, a[i] + 1) * query2(i + 1, N, a[i] + 1);

		bit.update(a[i], -R[a[i]] * L[a[i]]);
		L[a[i]]++;
		bit.update(a[i], R[a[i]] * L[a[i]]);
	}

	vector<long long> sum(A.size() + 2);
	for (int i = 0; i < A.size() + 1; i++) {
		sum[i + 1] = sum[i] + cnt[i];
	}

	for (int i = 0; i < Q; i++) {
		printf("%lld\n", sum[rr[i] + 1] - sum[ll[i]]);
	}
}