const oo=;

 var tree:array[..]of record

                               a,s:int64;

                              end;

     a:array[..]of int64;

     n,q,len,x,y,z,p:int64;

     ch,s:string;

     i,j,k:longint;

 procedure pushdown(p:int64);

 begin

  tree[p<<].s:=tree[p<<].s+tree[p].a;

  tree[p<<].a:=tree[p<<].a+tree[p].a;

  tree[p<<+].s:=tree[p<<+].s+tree[p].a;

  tree[p<<+].a:=tree[p<<+].a+tree[p].a;

  tree[p].a:=;

 end;

 procedure pushup(p:int64);

 begin

  if tree[p<<].s<tree[p<<+].s then tree[p].s:=tree[p<<].s

   else tree[p].s:=tree[p<<+].s;

 // tree[p].s:=min(tree[p<<].s,tree[p<<+].s);

 end;

 procedure build(l,r,p:int64);

 var mid:int64;

 begin

  if l=r then

  begin

   tree[p].s:=a[l];

   tree[p].a:=;

   exit;

  end;

  mid:=(l+r)>>;

  if l<=mid then build(l,mid,p<<);

  if r>mid then build(mid+,r,p<<+);

  pushup(p);

 end;

 function query(l,r,x,y,p:int64):int64;

 var mid:int64;t,ret:int64;

 begin

  if (x<=l)and(y>=r) then exit(tree[p].s);

  pushdown(p);

  mid:=(l+r)>>;

  ret:=oo;

  //query:=oo;

  if x<=mid then ret:=query(l,mid,x,y,p<<);

  if y>mid then

  begin

   t:=query(mid+,r,x,y,p<<+);

   if t<ret then ret:=t; //query:=min(query,t);

  end;

  exit(ret);

 end;

 procedure update(l,r,x,y,v,p:int64);

 var mid:int64;

 begin

  if (x<=l)and(y>=r) then

  begin

   tree[p].s:=tree[p].s+v;

   tree[p].a:=tree[p].a+v;

   exit;

  end;

  pushdown(p);

  mid:=(l+r)>>;

  if x<=mid then update(l,mid,x,y,v,p<<);

  if y>mid then update(mid+,r,x,y,v,p<<+);

  pushup(p);

 end;

 begin

  readln(n);

  for i:= to n do read(a[i]);

  for i:= to n<< do tree[i].s:=oo;

  build(,n,);

  readln(q);

  for i:= to q do

  begin

   readln(ch); len:=length(ch);

   p:=;

   for j:= to len do

    if ch[j]=' ' then inc(p);

   if p= then

   begin

    x:=;

    j:=;

    repeat

     inc(j);

     if ch[j]<>' ' then x:=x*+ord(ch[j])-ord('')

      else break;

    until j=len;

    y:=;

    repeat

     inc(j);

     if ch[j]<>' ' then y:=y*+ord(ch[j])-ord('')

      else break;

    until j=len;

    inc(x); inc(y);

    if x<=y then writeln(query(,n,x,y,))

     else

      if query(,n,x,n,)<query(,n,,y,) then writeln(query(,n,x,n,))

       else writeln(query(,n,,y,));

   end

    else

    begin

     x:=;

     j:=;

     repeat

      inc(j);

      if ch[j]<>' ' then x:=x*+ord(ch[j])-ord('')

       else break;

     until j=len;

     y:=;

     repeat

      inc(j);

      if ch[j]<>' ' then y:=y*+ord(ch[j])-ord('')

       else break;

     until j=len;

     s:='';

     for k:=j+ to len do s:=s+ch[k];

     val(s,z);

     inc(x); inc(y);

     if x<=y then update(,n,x,y,z,)

      else

      begin

       update(,n,x,n,z,);

       update(,n,,y,z,);

      end;

    end;

  end;

 end.