#pragma GCC target("avx")
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#include<bits/stdc++.h>
using namespace std;
#define TLE ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N=5e5+10;
int n,q,len,nl=1,nr=0,cnt;
int a[N],loc[N],vis[N],ans[N];
int re[N],res[N];
struct node{
	int l,r,id;
	bool operator<(const node &y) const{
		return (loc[l]^loc[y.l])?loc[l]<loc[y.l]:((loc[l]&1)?r<y.r:r>y.r);
	}
}query[N];
void add(int x){
	if(vis[a[x]]==1){
		re[res[a[x]]]=re[cnt];//将数组末尾的数转移到要去除的数的位置 
		res[re[cnt]]=res[a[x]];//这个数的下标变为要去除的数的下标
		re[cnt]=0;
		res[a[x]]=0;
		cnt--; 
	}
	if(vis[a[x]]==0){
		re[++cnt]=a[x];
		res[a[x]]=cnt;
	}
	vis[a[x]]++;
}
void del(int x){
	if(vis[a[x]]==1){
		re[res[a[x]]]=re[cnt];
		res[re[cnt]]=res[a[x]];
		re[cnt]=0;
		res[a[x]]=0;
		cnt--; 
	}
	if(vis[a[x]]==2){
		re[++cnt]=a[x];
		res[a[x]]=cnt;
	}
	vis[a[x]]--;
}
int main(){
	TLE;
	cin>>n;
	len=sqrt(n);
	for(int i=1;i<=n;i++){
		cin>>a[i];
		loc[i]=(i-1)/len+1;
	}
	cin>>q;
	for(int i=1;i<=q;i++){
		cin>>query[i].l>>query[i].r;
		query[i].id=i;
	}
	sort(query+1,query+1+q);
	for(int i=1;i<=q;i++){
		int l=query[i].l,r=query[i].r;
		while(nl>l)add(--nl);
		while(nr<r)add(++nr);
		while(nr>r)del(nr--);
		while(nl<l)del(nl++);
		ans[query[i].id]=re[1];
	}
	for(int i=1;i<=q;i++){
		cout<<ans[i]<<endl;
	}
	return 0;
}

88pts,后面的T了