#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }

#ifdef NDEBUG
#error assert is disabled!
#endif

template<typename T>
T readNatural(T lo, T up) {
	assert(0 <= lo && lo <= up);
	T x = 0;
	while(1) {
		int d = getchar();
		if(!('0' <= d && d <= '9')) {
			ungetc(d, stdin);
			break;
		}
		d -= '0';
		assert(d <= up && x <= (up - d) / 10);
		x = x * 10 + d;
	}
	assert(lo <= x && x <= up);
	return x;
}

void readSpace() { int c = getchar(); assert(c == ' '); }
static bool read_eof = false;
void readEOL() {
	int c = getchar();
	if(c == EOF) {
		assert(!read_eof);
		read_eof = true;
	} else {
		assert(c == '\n');
	}
}
void readEOF() {
	assert(!read_eof);
	int c = getchar();
	assert(c == EOF);
	read_eof = true;
}


struct FenwickTree {
	typedef int T;
	vector<T> v;
	void init(int n) { v.assign(n, 0); }
	void add(int i, T x) {
		for(; i < (int)v.size(); i |= i + 1) v[i] += x;
	}
	T sum(int i) const {	//[0, i)
		T r = 0;
		for(-- i; i >= 0; i = (i & (i + 1)) - 1) r += v[i];
		return r;
	}
	T sum(int left, int right) const {	//[left, right)
		return sum(right) - sum(left);
	}
};

int main() {
	int N = readNatural(1, 200000);
	readEOL();
	vector<int> A(N);
	for(int i = 0; i < N; ++ i) {
		if(i != 0) readSpace();
		A[i] = readNatural(1, (int)1e9);
	}
	readEOL();

	vector<int> values = A;
	sort(values.begin(), values.end());
	values.erase(unique(values.begin(), values.end()), values.end());
	int X = (int)values.size();
	for(auto &x : A)
		x = (int)(lower_bound(values.begin(), values.end(), x) - values.begin());

	vector<long long> ansSum(X + 1);
	FenwickTree ftL, ftR;
	ftL.init(X);
	ftR.init(X);
	vector<int> numL(X), numR(X);
	ll sumProd = 0;
	for(int x : A) {
		ftR.add(x, 1);
		++ numR[x];
	}
	for(int x : A) {
		ftR.add(x, -1);
		-- numR[x];
		sumProd -= numL[x];

		ll cnt = 0;
		cnt += (ll)ftL.sum(x) * ftR.sum(x);
		cnt += (ll)ftL.sum(x + 1, X) * ftR.sum(x + 1, X);
		cnt -= sumProd - (ll)numL[x] * numR[x];
		ansSum[x + 1] += cnt;

		ftL.add(x, 1);
		++ numL[x];
		sumProd += numR[x];
	}
	rep(x, X)
		ansSum[x + 1] += ansSum[x];

	int Q = readNatural(1, 200000);
	readEOL();
	rep(ii, Q) {
		int L = readNatural(1, (int)1e9);
		readSpace();
		int R = readNatural(L, (int)1e9);
		readEOL();

		int l = (int)(lower_bound(values.begin(), values.end(), L) - values.begin());
		int r = (int)(upper_bound(values.begin(), values.end(), R) - values.begin());
		long long ans = ansSum[r] - ansSum[l];
		printf("%lld\n", ans);
	}
	readEOF();
	return 0;
}