#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;
#define MAXN 40001
typedef vector<int>::iterator VER;
int T[MAXN],plt;
int n,m,a[MAXN],pl[MAXN],upd,num_mo[MAXN],anss[MAXN],num_pl[MAXN],l_pl[MAXN],s_pl[MAXN];
vector<int>LiSan[MAXN],evpl[MAXN],evnum[MAXN],evl[MAXN],evs[MAXN],evb[MAXN];
bool vis[MAXN];
struct Ask{int l,r,k1,k2,p;}Q[MAXN];
bool operator < (const Ask &a,const Ask &b)
{return num_mo[a.l]!=num_mo[b.l] ? num_mo[a.l]<num_mo[b.l] : a.r<b.r;}
void Mo_Make_Block()
{int tot=1,sz=sqrt(n);if(!sz) sz=1;for(;tot*sz<n;++tot){int r=tot*sz;for(int i=(tot-1)*sz+1;i<=r;++i)num_mo[i]=tot;}for(int i=(tot-1)*sz+1;i<=n;++i)num_mo[i]=tot;
}
void pl_Make_Block()
{plt=1;int sz=sqrt(upd);if(!sz) sz=1;for(;plt*sz<upd;++plt){l_pl[plt]=(plt-1)*sz+1;int r=plt*sz;for(int i=l_pl[plt];i<=r;++i)num_pl[i]=plt;}l_pl[plt]=(plt-1)*sz+1;for(int i=l_pl[plt];i<=upd;++i)num_pl[i]=plt;
}
void Insert(const int &x)
{if(T[x]){--pl[T[x]];if(!pl[T[x]])--s_pl[num_pl[T[x]]];--evb[T[x]][LiSan[x][T[x]]];--evs[T[x]][evnum[T[x]][LiSan[x][T[x]]]];}++T[x];if(!pl[T[x]])++s_pl[num_pl[T[x]]];++pl[T[x]];++evb[T[x]][LiSan[x][T[x]]];++evs[T[x]][evnum[T[x]][LiSan[x][T[x]]]];
}
void Delete(const int &x)
{--pl[T[x]];if(!pl[T[x]])--s_pl[num_pl[T[x]]];--evb[T[x]][LiSan[x][T[x]]];--evs[T[x]][evnum[T[x]][LiSan[x][T[x]]]];--T[x];if(T[x]){if(!pl[T[x]])++s_pl[num_pl[T[x]]];++pl[T[x]];++evb[T[x]][LiSan[x][T[x]]];++evs[T[x]][evnum[T[x]][LiSan[x][T[x]]]];}
}
int Query(const int &K1,const int &K2)
{int cnt1=0,cnt2=0;for(int i=1;;++i){cnt1+=s_pl[i];if(cnt1>=K1){cnt1-=s_pl[i];for(int j=l_pl[i];;++j){cnt1+=(bool)pl[j];if(cnt1>=K1){for(int k=1;;++k){cnt2+=evs[j][k];if(cnt2>=K2){cnt2-=evs[j][k];for(int l=evl[j][k];;++l){cnt2+=evb[j][l];if(cnt2>=K2)return evpl[j][l];}}}}}}}
}
int main()
{scanf("%d",&n);Mo_Make_Block();for(int i=1;i<=n;++i){scanf("%d",&a[i]);++pl[a[i]];}upd=*max_element(pl+1,pl+n+1);pl_Make_Block();for(int i=1;i<=n;++i)if(!vis[a[i]]){vis[a[i]]=1;LiSan[a[i]].assign(pl[a[i]]+1,0);for(int j=1;j<=pl[a[i]];++j)evpl[j].push_back(a[i]);}for(int i=1;i<=upd;++i){//分段离散化sort(evpl[i].begin(),evpl[i].end());int k=1;for(VER j=evpl[i].begin();j!=evpl[i].end();++j,++k)LiSan[*j][i]=k;//分段权值分块int Lim=evpl[i].size();evb[i].assign(Lim+1,0);int tot=1,sz=sqrt(Lim);evl[i].push_back(0);evnum[i].push_back(0);if(!sz) sz=1;for(;tot*sz<Lim;++tot){evl[i].push_back((tot-1)*sz+1);int r=tot*sz;for(int j=evl[i][tot];j<=r;++j)evnum[i].push_back(tot);}evl[i].push_back((tot-1)*sz+1);for(int j=evl[i][tot];j<=Lim;++j)evnum[i].push_back(tot);evs[i].assign(tot+1,0);evpl[i].insert(evpl[i].begin(),0);}scanf("%d",&m);for(int i=1;i<=m;++i){scanf("%d%d%d%d",&Q[i].l,&Q[i].r,&Q[i].k1,&Q[i].k2);Q[i].p=i;}sort(Q+1,Q+m+1);memset(pl,0,(n+1)*sizeof(int));for(int i=Q[1].l;i<=Q[1].r;++i)Insert(a[i]);anss[Q[1].p]=Query(Q[1].k1,Q[1].k2);for(int i=2;i<=m;++i){if(Q[i].l<Q[i-1].l)for(int j=Q[i-1].l-1;j>=Q[i].l;--j)Insert(a[j]);if(Q[i].r>Q[i-1].r)for(int j=Q[i-1].r+1;j<=Q[i].r;++j)Insert(a[j]);if(Q[i].l>Q[i-1].l)for(int j=Q[i-1].l;j<Q[i].l;++j)Delete(a[j]);if(Q[i].r<Q[i-1].r)for(int j=Q[i-1].r;j>Q[i].r;--j)Delete(a[j]);anss[Q[i].p]=Query(Q[i].k1,Q[i].k2);}for(int i=1;i<=m;++i)printf("%d\n",anss[i]);return 0;
}