#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

typedef tree<int,null_type,less<int>,rb_tree_tag,
        tree_order_statistics_node_update> indexed_set;

typedef long long ll;
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define  P pair
#define V vector
const long long MOD = 1000000007; // 1e9 + 7


void file(){
    freopen("input.txt.txt","r",stdin);
    freopen("output.txt.txt","w",stdout);
}
void setio(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
struct segtree{
private:
    struct node{
        ll sum;
    };
    node neutral={0LL};
    node single(ll x){
        return {x};
    }
    node merge(node a,node b){
        return{a.sum+b.sum};
    };
public:
    int size;
    V<node>query;
    void init(int n){
        size=1;
        while(size<n)size*=2;
        query.assign(2*size,neutral);
    }
    void build(V<ll>&a,int x,int lx,int rx){
        if(rx-lx==1){
            if(lx<a.size())
                query[x]=single(a[lx]);
            return;
        }
        int m=(lx+rx)/2;
        build(a,2*x+1,lx,m);
        build(a,2*x+2,m,rx);
        query[x]=merge(query[2*x+1],query[2*x+2]);
    }
    void build(V<ll>a){
        build(a,0,0,size);
    }
    void set(ll i,ll v,int x,int lx,int rx){
        if(rx-lx==1){
            query[x]=single(v);
            return;
        }
        int m=(lx+rx)/2;
        if(i<m){
            set(i,v,2*x+1,lx,m);
        }
        else
            set(i,v,2*x+2,m,rx);
        query[x]=merge(query[2*x+1],query[2*x+2]);
    }
    void set(ll i,ll v){
        set(i,v,0,0,size);
    }
    node  calc(ll l,ll r,int x,int lx,int rx){
        if(l<=lx && rx<=r)
            return query[x];
        if(lx>=r || rx<=l)
            return neutral;
        int m=(lx+rx)/2;
        node a=calc(l,r,2*x+1,lx,m);
        node b=calc(l,r,2*x+2,m,rx);
        return merge(a,b);
    }
    ll calc(ll l,ll r){
        return calc(l,r,0,0,size).sum;
    }
};
struct querie{
    ll f;
    ll s;
    ll k;
    ll index;
};
bool maker1(querie a,querie b){
    return a.f<=b.f;
}
bool maker2(querie a,querie b){
    return a.s<=b.s;
}
void solve() {
   ll n;
   cin>>n;
   ll A[n];
   V<ll>compressor;
   map<ll,ll>mp;
   for(int i=0;i<n;i++) {
       cin >> A[i];
       compressor.pb(A[i]);
   }
   ll q;cin>>q;
   querie Q[q];
   for(int i=0;i<q;i++){
         cin>>Q[i].f>>Q[i].s>>Q[i].k;
         Q[i].f--,Q[i].s--;
         compressor.pb(Q[i].k);
         Q[i].index=i;
   }
   //start coordinate compression
   sort(all(compressor));
   auto it=unique(all(compressor));
   compressor.resize(distance(compressor.begin(),it));
   for(int i=0;i<compressor.size();i++){
       mp[compressor[i]]=i;
   }
   for(int i=0;i<n;i++)
       A[i]=mp[A[i]];
   for(int i=0;i<q;i++)
       Q[i].k=mp[Q[i].k];
   //finish coordinate compression
   //start left part computation
    segtree tree;
    tree.init(3e6);
    P<ll,ll>ans[q];
    V<ll>a(3e6);
    for(int i=0;i<n;i++){
        a[A[i]]++;
    }
    tree.build(a);
    sort(Q,Q+q, maker1);
    int j=0;
    for(int i=0;i<n;i++){
        while(Q[j].f==i && j<q){
            ans[Q[j].index].F=tree.calc(Q[j].k+1,3e6);
            j++;
        }
        a[A[i]]--;
        tree.set(A[i],a[A[i]]);
    }
    for(int i=0;i<n;i++){
        a[A[i]]++;
    }
    tree.build(a);
    sort(Q,Q+q, maker2);
    j=0;
    for(int i=0;i<n;i++){
        a[A[i]]--;
        tree.set(A[i],a[A[i]]);
        while(Q[j].s==i  && j<q){
            ans[Q[j].index].S=tree.calc(Q[j].k+1,3e6);
            j++;
        }
    }
    for(int i=0;i<q;i++){
        cout<<ans[i].F-ans[i].S<<endl;
    }
}


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    //file();
    solve();
    return 0;
}