#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll,ll>;
using ld=long double;
const ll INF=(1ll<<60);
#define rep(i,n) for (ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(),v.end()
template<class T> inline bool chmin(T &a,T b){
    if(a>b){
        a=b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T &a,T b){
    if(a<b){
        a=b;
        return true;
    }
    return false;
}
ll cnt[1000001];
ll f_linear(vector<ll> a,ll n,ll k){  //O(n)
    if(k==0) return 0;
    
    vector<ll> vr(n,0);
    ll r=0,sz=0;
    rep(l,n){
        auto g=[&](ll idx){
            ll p=0;
            if(cnt[a[idx]]==0) p=1;
            return (sz+p)<=k;
        };
        while(r<n&&g(r)){
            if(cnt[a[r]]==0) sz++;
            cnt[a[r]]++;
            r++;
        }
        vr[l]=r;
        cnt[a[l]]--;
        if(cnt[a[l]]==0) sz--;
    }
    vector<__int128> dp(n+1,0),sum(n+2,0);
    dp[0]=1;
    rep(i,n+1){
        dp[i]+=sum[i];
        if(INF<dp[i]) return INF*2;
        if(i==n) break;
        sum[i+1]+=dp[i];
        sum[1+vr[i]]-=dp[i];
        sum[i+1]+=sum[i];
    }
    return dp[n];
}
void solve_linear(vector<ll> a,ll s,auto &f){  //O(N)
    ll n=(ll)a.size();
    ll ok=0;
    rep(i,n+1){
        if(f(a,n,i)<=s) chmax(ok,i);
        else break;
    }
    cout << ok << '\n';

}
void solve_b(vector<ll> a,ll s){  //O(M^2)
    return solve_linear(a,s,f_linear);
}


int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll n;
    cin >> n;
    vector<ll> x(n);
    rep(i,n) cin >> x[i];
    x.push_back(INF);
    vector<ll> li,ri;
    ll cnt=1;
    rep(i,n){
        if(x[i]==x[i+1]) cnt++;
        else{
            if(cnt!=1){
                li.push_back(i-cnt+1);
                ri.push_back(i+1);
            }
            cnt=1;
        }
    }
    ll q;
    cin >> q;
    while(q--){
        ll l,r,s;
        cin >> l >> r >> s;
        l--;
        ll sz=r-l;
        if((1ll<<min(61ll,sz-1))<=s){
            cout << "-1\n";
            continue;
        }else if(sz<87){
            vector<ll> a;
            for(ll i=l;i<r;i++) a.push_back(x[i]);
            solve_b(a,s);
        }else{
            ll i=lower_bound(all(li),l)-li.begin();
            i=max(0ll,i-1);
            __int128 now=1;
            for(;i<(ll)li.size();i++){
                ll a=max(li[i],l),b=min(ri[i],r);
                ll k=b-a;
                if(k<=0) continue;
                now*=(1ll<<min(61ll,k-1));
                if(s<now) break;
            }
            if(s<now) cout << "0\n";
            else cout << "1\n";
        }
    }
}