// 
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=2e5+5,V=2e5,B=2048;
int n,a[N],Q,be[N],ti;
void f(int &x,int y){x=x>0?x-y:x+y;}
struct Blocks
{
    int L,R,trans[N];
    ll sum;
    void Build(int vl,int vr,int now)
    {
        // if(++ti<10000)printf("%-8d %-8d %-8d\n",vl,vr,now);
        if(now>R)
        {
            // printf("trans:%d %d %d %d\n",L,R,vl,vr);
            int x=0;
            if(vl<=vr)for(int i=vl;i<=vr;i++)trans[i]=++x;
            else for(int i=vl;i>=vr;i--)trans[i]=x--;
            return;
        }
        int w=a[now];
        // printf("%d %d %d %d\n",vl,vr,now,w);
        if(vl<=vr)
        {
            if(2*w<=vr-vl+1)
            {
                Build(vl+w,vr,now+1);
                for(int i=vl+w-1,j=vl+w;i>=vl;i--,j++)
                {
                    if(i<=0)printf("ERR:%d\n",i);
                    trans[i]=1-trans[j];
                }
            }
            else
            {
                Build(vl+w-1,vl,now+1);
                for(int i=vl+w,j=vl+w-1;i<=vr;i++,j--)
                {
                    if(j<=0)printf("ERR:%d\n",j);
                    trans[i]=1-trans[j];
                }
            }
        }
        else
        {
            if(2*w<=vl-vr+1)
            {
                Build(vl-w,vr,now+1);
                for(int i=vl-w+1,j=vl-w;i<=vl;i++,j--)
                {
                    if(j<=0)printf("ERR:%d\n",j);
                    trans[i]=1-trans[j];
                }
            }
            else
            {
                Build(vl-w+1,vl,now+1);
                for(int i=vl-w,j=vl-w+1;i>=vr;i--,j++)
                {
                    if(i<=0)printf("ERR:%d\n",i);
                    trans[i]=1-trans[j];
                }
            }
        }
    }
    void Print()
    {
        printf("%d %d\n",L,R);
        for(int i=1;i<=100;i++)printf("%d ",trans[i]);puts("");
    }
}bl[N/B+5];
int main()
{
	#ifndef ONLINE_JUDGE
	freopen(".in","r",stdin);
	freopen(".out","w",stdout);
	#endif
	
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%d",&a[i]),be[i]=(i-1)/B+1,bl[be[i]].sum+=a[i];
    for(int i=1;i<=be[n];i++)
    {
        // printf("R:%d %d\n",i,bl[i].R);
        bl[i].L=bl[i-1].R+1;
        bl[i].R=min(i*B,n);
        bl[i].Build(1,V,bl[i].L);
        // bl[i].Print();
    }
	cerr<<1.0*clock()/CLOCKS_PER_SEC<<'\n';
    scanf("%d",&Q);
    while(Q--)
    {
        int l,r,x;
        scanf("%d%d%d",&l,&r,&x);
		while(l<=r&&l!=bl[be[l]].L)f(x,a[l++]);
		while(l<=r&&be[l]!=be[r]&&((x>V&&x-bl[be[l]].sum>V)||(x<=-V&&x+bl[be[l]].sum<=-V)))f(x,bl[be[l]].sum),l+=B;
		// printf("  %d %d %d\n",l,r,x);
		if(l<=r)f(x,a[l++]);
		while(l<=r&&l!=bl[be[l]].L)f(x,a[l++]);
		// printf("  1:%d %d %d\n",l,r,x);
		while(l<=r&&be[l]<be[r])
        {
            // printf("%d %d %d %d\n",bl[be[l]].L,bl[be[l]].R,x,be[l]);
            // if(x>0)printf("%d ",bl[be[l]].trans[x]);
            // else printf("%d ",1-bl[be[l]].trans[1-x]);
            x=x>0?bl[be[l]].trans[x]:1-bl[be[l]].trans[1-x],l+=B;
        }
        // puts("");
		while(l<=r)f(x,a[l++]);
		printf("%d\n",x);
    }
    cerr<<bl[45].trans[88]<<'\n';
	cerr<<1.0*clock()/CLOCKS_PER_SEC<<'\n';
}