from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
input = sys.stdin.readline

N = int(input())
A = list(map(int,input().split()))
class SegTree:
    """
    Segment Tree
    """

    def __init__(self, init_val, segfunc, ide_ele):
        """
        初期化

        init_val: 配列の初期値
        """
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.tree = [ide_ele] * 2 * self.num
        # 配列の値を葉にセット
        for i in range(n):
            self.tree[self.num + i] = init_val[i]
        # 構築していく
        for i in range(self.num - 1, 0, -1):
            self.tree[i] = segfunc(self.tree[2 * i], self.tree[2 * i + 1])

    def update(self, k, x):
        """
        k番目の値をxに更新

        k: index(0-index)
        x: update value
        """
        k += self.num
        self.tree[k] = x
        while k > 1:
            self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
            k >>= 1

    def query(self, l, r):
        """
        [l, r)のsegfuncしたものを得る

        l: index(0-index)
        r: index(0-index)
        """
        res = self.ide_ele

        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                res = self.segfunc(res, self.tree[l])
                l += 1
            if r & 1:
                res = self.segfunc(res, self.tree[r - 1])
            l >>= 1
            r >>= 1
        return res
val = defaultdict(int)
X = [(a,i) for i,a in enumerate(A)]
X.sort()
T = SegTree([0]*N,lambda x,y:x+y,0)
C = Counter(A)
V = SegTree([0]*(N+3),lambda x,y:x+y,0)
stack = []
for i in range(N):
    
    a,idx = X[i]
    stack.append(idx)
    C[a] -= 1
    val[a] += T.query(0,idx)*T.query(idx,N) - V.query(0,idx+1)
    if C[a]!=0:
        continue
    for jdx in stack:
        T.update(jdx,1)
    n = len(stack)
    stack.sort()
    for i in range(n-1):
        l = stack[i]
        r = stack[i+1]
        cnt = (i+1)*(n-1-i)
        V.update(l+1,V.query(l+1,l+2)+cnt)
        V.update(r,V.query(r,r+1)-cnt)
    stack = []
    
X.reverse()
T = SegTree([0]*N,lambda x,y:x+y,0)
C = Counter(A)
V = SegTree([0]*(N+3),lambda x,y:x+y,0)
stack = []
for i in range(N):
    
    a,idx = X[i]
    stack.append(idx)
    C[a] -= 1
    val[a] += T.query(0,idx)*T.query(idx,N) - V.query(0,idx+1)
    if C[a]!=0:
        continue
    for jdx in stack:
        T.update(jdx,1)
    n = len(stack)
    stack.sort()
    for i in range(n-1):
        l = stack[i]
        r = stack[i+1]
        cnt = (i+1)*(n-1-i)
        V.update(l+1,V.query(l+1,l+2)+cnt)
        V.update(r,V.query(r,r+1)-cnt)
    stack = []
def cle(a,D):
    
    y = len(D)-1
    x = 0
    if D[x]>a:
        return 0
        
    if D[y]<=a:
        return y+1
    
    while y-x>1:
        mid = (y+x)//2
        if D[mid]<=a:
            x = mid
        else:
            y = mid
    return y
B = list(set([0]+A))
B.sort()
S = list(accumulate([0]+[val[b] for b in B]))
Q = int(input())
n = len(B)
def count(H):
    
    h = cle(H,B)
    h = min(h,n-1)
    while B[h]>H:
        h -= 1
    return S[h+1]
    
for _ in range(Q):
    l,h = map(int,input().split())
    print(count(h)-count(l-1))