#include<bits/stdc++.h>

#define N 50010

typedef long long ll;

using namespace std;

inline int read(){

    int f=,x=;char ch;

    do{ch=getchar();if(ch=='-')f=-;}while(ch<''||ch>'');

    do{x=x*+ch-'';ch=getchar();}while(ch>=''&&ch<='');

    return f*x;

}

int c1[N],c2[N],a[N],n,m,cnt;

struct Query{

    int l,r,id;

    bool operator < (const Query &ths) const {

        if(l/!=ths.l/) return l<ths.l;

        if(l/&) return r>ths.r;

        else return r<ths.r;

    }

}q[N<<];

ll ans[N],tot=,Ans=;

int main(){

    n=read();for(int i=;i<=n;i++)a[i]=read();

    m=read();

    for(int i=;i<=m;i++){

        int l1=read(),r1=read(),l2=read(),r2=read();

        q[++cnt]=(Query){r1,r2,i};

        if(l1>)q[++cnt]=(Query){l1-,r2,-i};

        if(l2>)q[++cnt]=(Query){l2-,r1,-i};

        if(l1>&&l2>)q[++cnt]=(Query){l1-,l2-,i};

    }

    for(int i=;i<=cnt;i++)if(q[i].l>q[i].r)swap(q[i].l,q[i].r);

    sort(q+,q+cnt+);

    int l=,r=;c1[a[]]++;

    for(int i=;i<=cnt;i++){

        while(r<q[i].r)r++,Ans+=c1[a[r]],c2[a[r]]++;

        while(l<q[i].l)l++,Ans+=c2[a[l]],c1[a[l]]++;

        while(r>q[i].r)Ans-=c1[a[r]],c2[a[r]]--,r--;

        while(l>q[i].l)Ans-=c2[a[l]],c1[a[l]]--,l--;

        if(q[i].id<) ans[-q[i].id]-=Ans;

        else ans[q[i].id]+=Ans;

    }

    for(int i=;i<=m;i++)printf("%lld\n",ans[i]);

}