// 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int SZ=1<<20;
char buf[SZ],*p1,*p2;
#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,SZ,stdin),p1==p2)?EOF:*p1++)
ll read(){
	ll n=0; bool m=0;
	char c=gc();
	while(c<'0'||c>'9')m=c=='-',c=gc();
	while(c>='0'&&c<='9')n=(n<<3)+(n<<1)+(c^'0'),c=gc();
	return m?-n:n;
}
const int N=2e5+5,B=500;
void f(int &x,int y){x<=0?(x+=y):(x-=y);}
int n,m,a[N],c[N],ql[N],qr[N],qx[N];
ll b[N];
int L[N],R[N],bel[N],bls;
void solve(int l,int r,int pl,int pr){
	if(pl>pr){
		int x=0;
		if(l<=r)for(int i=l;i<=r;i++)c[i]=++x;
		else for(int i=r;i>=l;i--)c[i]=x--;
		return;
	}
	int x=a[pl],y=abs(r-l+1)-a[pl];
	if(l<=r){
		if(x<=y){
			solve(l+a[pl],r,pl+1,pr);
			for(int i=l+a[pl]-1,j=l+a[pl];i>=l;i--,j++)c[i]=1-c[j];
		}else{
			solve(l+a[pl]-1,l,pl+1,pr);
			for(int i=l+a[pl],j=l+a[pl]-1;i<=r;i++,j--)c[i]=1-c[j];
		}
	}else{
		if(x<=y){
			solve(l-a[pl],r,pl+1,pr);
			for(int i=l-a[pl]+1,j=l-a[pl];i<=l;i++,j--)c[i]=1-c[j];
		}else{
			solve(l-a[pl]+1,l,pl+1,pr);
			for(int i=l-a[pl],j=l-a[pl]+1;i>=r;i--,j++)c[i]=1-c[j];
		}
	}
}
int main(){
	n=read();
	for(int i=1;i<=n;i++)a[i]=read(),b[i]=b[i-1]+a[i];
	for(int l=1,r=min(B,n);l<=n;l+=B,r=min(r+B,n)){
		bls++,L[bls]=l,R[bls]=r;
		for(int i=l;i<=r;i++)bel[i]=bls;
	}
	m=read();
	for(int i=1;i<=m;i++){
		ql[i]=read(),qr[i]=read(),qx[i]=read();
		int x=qx[i]<=0?-qx[i]:qx[i]-1,l=ql[i]-1,r=qr[i],mid;
		while(l<r){
			mid=(l+r>>1)+1;
			if(b[mid]-b[ql[i]-1]<x)l=mid;
			else r=mid-1;
		}
		f(qx[i],b[l]-b[ql[i]-1]),ql[i]=l+1;
		if(ql[i]<=qr[i]&&bel[ql[i]]!=bel[qr[i]]){
			for(int j=ql[i];j<=R[bel[ql[i]]];j++)f(qx[i],a[j]);
			ql[i]=R[bel[ql[i]]]+1;
		}
	}
	for(int i=2;i<bls;i++){
		solve(1,N-5,L[i],R[i]);
		for(int j=1;j<=m;j++){
			if(ql[j]<=qr[j]&&bel[ql[j]]==i&&bel[ql[j]]!=bel[qr[j]]){
				if(qx[j]<=0)qx[j]=1-c[1-qx[j]];
				else qx[j]=c[qx[j]];
				ql[j]=R[i]+1;
			}
		}
	}
	for(int i=1;i<=m;i++){
		for(int j=ql[i];j<=qr[i];j++)f(qx[i],a[j]);
		printf("%d\n",qx[i]);
	}
	return 0;
}