#include<iostream>
using namespace std;
const int N=2e5+5,M=30;
int n,m;
int L,k;
int a[N],s[M][N];
bool check(int mid){
	int ans=0;
	for(int i=0;i<M;i++){
		if(s[i][mid]-s[i][L-1]==mid-L+1){
			ans+=(1<<i);
		}
	}
	return ans>=k;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		for(int j=0;j<M;j++){
			if(a[i]>>j&1){
				s[j][i]=s[j][i-1]+1;
			}
			else{
				s[j][i]=s[j][i-1];
			}
		}
	}
	cin>>m;
	while(m--){
		cin>>L>>k;
		int l=L,r=n,ans=-1;
		while(l<=r){
			int mid=(l+r)/2;
			if(check(mid)){
				ans=mid;
				l=mid+1;
			}
			else{
				r=mid-1;
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}