#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
using ll=long long;
int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n;
	cin>>n;
	vector<int> x(n);
	for(int i=0;i<n;i++) cin>>x[i];
	vector<int> sum(n);
	for(int i=0;i<n-1;i++) sum[i+1]=sum[i]+(x[i]==x[i+1]?1:0);
	int q;
	cin>>q;
	while(q--){
		int l,r;
	    ll s;
	    cin>>l>>r>>s;
	    --l;
	    --r;
	    if(sum[r]-sum[l]>60||(1ll<<(sum[r]-sum[l]))>s){
	        cout<<0<<endl;
	        continue;
	    }
	    if(r-l+1<=61&&(1ll<<(r-l))<=s){
	        cout<<-1<<endl;
	        continue;
	    }
	    if(r-l+1>=100){
	        cout<<1<<endl;
	        continue;
	    }
	    int ok=1,ng=r-l+2;
	    while(ng-ok>1){
	        int m=(ok+ng)/2;
	        vector<int> mp(n+1);
	        int j=l,cnt=0;
	        vector<ll> dp(r-l+3);
	        bool isok=false;
	        dp[0]=1;
	        dp[1]=-1;
	        for(int i=l;i<=r;i++){
	            while(j<=r&&cnt<=m){
	                if(mp[x[j]]==0) cnt++;
	                if(cnt>m){
	                    cnt--;
	                    break;
	                }
	                mp[x[j]]++;
	                j++;
	            }
	            if(dp[i-l]>s){
	                isok=true;
	                break;
	            }
	            dp[i-l+1]+=dp[i-l];
	            dp[i-l+1]+=dp[i-l];
	            dp[j-l+1]-=dp[i-l];
	            mp[x[i]]--;
	            if(mp[x[i]]==0) cnt--;
	        }
	        if(isok||dp[r-l+1]>s) ng=m;
	        else ok=m;
	    }
	    cout<<ok<<endl;
	}
}