#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;
}
template<class T> struct fenwick_tree{
    vector<T> v;
    int n;
    fenwick_tree(int x){
        n=x+1;
        v.assign(n+1,0);
    }
    fenwick_tree(vector<T> &a){
        n=(int)a.size()+1;
        v.assign(n+1,0);
        if((int)a.size()==0) return;
        v[1]=a[0];
        for(int i=0;i<n-2;i++) v[i+2]=a[i+1]-a[i];
        for(int idx=1;idx<=n;idx++){
            if(n<idx+(idx&(-idx))) continue;
            v[idx+(idx&(-idx))]+=v[idx];
        }
    }
    void add_sub(int i,T x){
        i++;
        for(int idx=i;idx<=n;idx+=(idx&(-idx))){
            v[idx]+=x;
        }
    }
    void add(int l,int r,T x){  //[l,r)
        assert(0<=l&&l<=n);
        assert(0<=r&&r<=n);
        assert(l<=r);
        add_sub(l,x);
        add_sub(r,-x);
    }
    T get(int i){
        assert(0<=i&&i<n);
        i++;
        T ret=0;
        for(int idx=i;0<idx;idx-=(idx&(-idx))){
            ret+=v[idx];
        }
        return ret;
    }
    int lower_bound(T w){
        if(w<=0) return 0;
        int x=0;
        static int r=1;
        if(r==1){
            while((r<<1)<=n) r<<=1;
        }
        while((r<<1)<=n) r<<=1;
        for(int k=r;0<k;k>>=1){
            if(x+k<=n&&v[x+k]<w){
                w-=v[x+k];
                x+=k;
            }
        }
        x++;
        return x;
    }
};
ll f_log(vector<ll> a,ll n,ll k){  //O(nlogn)
    if(k==0) return 0;
    
    vector<ll> vr(n,0);
    ll r=0,sz=0;
    unordered_map<ll,ll> mp;
    rep(l,n){
        auto g=[&](ll idx){
            ll p=0;
            if(mp[a[idx]]==0) p=1;
            return (sz+p)<=k;
        };
        while(r<n&&g(r)){
            if(mp[a[r]]==0) sz++;
            mp[a[r]]++;
            r++;
        }
        vr[l]=r;
        mp[a[l]]--;
        if(mp[a[l]]==0) sz--;
    }
    vector<__int128> st(n+1,0);
    st[0]=1;
    fenwick_tree<__int128> BIT(st);
    rep(i,n){
        if(INF<BIT.get(i))  return INF*2ll;
        BIT.add(i+1,1+vr[i],BIT.get(i));
    }
    return BIT.get(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);
    }
    cout << ok << '\n';

}
void solve_binary(vector<ll> a,ll s,auto &f){  //O(logN)
    ll n=(ll)a.size();
    ll ok=0,ng=n+1;
    while(1<abs(ok-ng)){
        ll mid=(ok+ng)/2;
        if(f(a,n,mid)<=s) ok=mid;
        else ng=mid;
    }
    cout << ok << '\n';
}

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


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<88){
            vector<ll> a;
            for(ll i=l;i<r;i++) a.push_back(x[i]);
            solve_a(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";
        }
    }
}