#include<bits/stdc++.h>
#define lowbit(i) (i & (-i))
using namespace std;
const int maxn = 1e5 + 10;
struct QUERY{int L, R, Len, id;bool operator < (const QUERY &rhs) const{if((L/Len) == (rhs.L/rhs.Len)) return R < rhs.R;else return (L/Len) < (rhs.L/rhs.Len);};
}Q[maxn]; int ans[maxn];int arr[maxn], N;
int uni[maxn], uniLen;int Bit[maxn];inline void BitAdd(int i, int val)
{while(i <= N){Bit[i] += val;i += lowbit(i);}
}int BitSum(int i)
{if(i == 0) return 0;int ret = 0;while(i > 0){ret += Bit[i];i -= lowbit(i);}return ret;
}int GetVal(int i)
{int ret = lower_bound(uni, uni+uniLen, arr[i]) - uni;return ++ret;
}int main(void)
{scanf("%d", &N);for(int i=0; i<N; i++) scanf("%d", &arr[i]), uni[i] = arr[i];sort(uni, uni+N);///题目貌似没说每个元素的大小，干脆离散化好了uniLen = unique(uni, uni+N) - uni;int qNum, sqrt_N = (int)sqrt(N);scanf("%d", &qNum);for(int i=0; i<qNum; i++){scanf("%d %d", &Q[i].L, &Q[i].R);Q[i].Len = sqrt_N;Q[i].id = i;}sort(Q, Q+qNum);int val, curL, curR, CurAns = 0;curL = 1, curR = 0;for(int i=0; i<qNum; i++){///在左边添加一个数、比这个数小的都贡献了一个逆序对、加上while(curL > Q[i].L){curL--;val = GetVal(curL-1);BitAdd(val, 1);CurAns += BitSum(val-1);}///在右边添加一个数、比这个数大的都贡献了一个逆序对、加上while(curR < Q[i].R){curR++;val = GetVal(curR-1);BitAdd(val, 1);CurAns += curR - curL - BitSum(val-1);}///在左边删除一个数、原本比这个数小的都贡献了一个逆序对、减去while(curL < Q[i].L){val = GetVal(curL-1);BitAdd(val, -1);CurAns -= BitSum(val-1);curL++;}///在右边删除一个数、原本比这个数大的都贡献了一个逆序对、减去while(curR > Q[i].R){val = GetVal(curR-1);BitAdd(val, -1);CurAns -= curR - curL - BitSum(val-1);curR--;}ans[Q[i].id] = CurAns;}for(int i=0; i<qNum; i++) printf("%d\n", ans[i]);return 0;
}