There is a system of *n* vessels arranged one above the other as shown in the figure below. Assume that the vessels are numbered from 1 to *n*, in the order from the highest to the lowest, the volume of the *i*-th vessel is *a*<sub class="lower-index">*i*</sub> liters.

Initially, all the vessels are empty. In some vessels water is poured. All the water that overflows from the *i*-th vessel goes to the (*i* + 1)-th one. The liquid that overflows from the *n*-th vessel spills on the floor.

Your task is to simulate pouring water into the vessels. To do this, you will need to handle two types of queries:
 1.  Add *x*<sub class="lower-index">*i*</sub> liters of water to the *p*<sub class="lower-index">*i*</sub>-th vessel; 1.  Print the number of liters of water in the *k*<sub class="lower-index">*i*</sub>-th vessel. 
When you reply to the second request you can assume that all the water poured up to this point, has already overflown between the vessels.
The first line contains integer *n* — the number of vessels (1 ≤ *n* ≤ 2·10<sup class="upper-index">5</sup>). The second line contains *n* integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> — the vessels' capacities (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>). The vessels' capacities do not necessarily increase from the top vessels to the bottom ones (see the second sample). The third line contains integer *m* — the number of queries (1 ≤ *m* ≤ 2·10<sup class="upper-index">5</sup>). Each of the next *m* lines contains the description of one query. The query of the first type is represented as "1 *p*<sub class="lower-index">*i*</sub> *x*<sub class="lower-index">*i*</sub>", the query of the second type is represented as "2 *k*<sub class="lower-index">*i*</sub>" (1 ≤ *p*<sub class="lower-index">*i*</sub> ≤ *n*, 1 ≤ *x*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>, 1 ≤ *k*<sub class="lower-index">*i*</sub> ≤ *n*).
class UnionSet:
    def __init__(self,n):
        self.val=list(range(n+1))
    def find(self,x):
        tmp=x
        while x!=self.val[x]:
            x=self.val[x]
            self.val[x]=self.val[self.val[x]]
            x=self.val[x]
        return self.val[x]
      
    def merge(self,x,y):
        xz=self.find(x);yz=self.find(y)
        self.val[xz]=yz
pyin=lambda:map(int,input().split())
n=int(input());v1=list(pyin())
m=int(input());v2=[0]*(n+1)
US=UnionSet(n)
for _ in range(m):
    arr=list(pyin());t=arr[0]
    if t==2:
        print(v2[arr[1]])
    elif t==1:
        i,ad=US.find(arr[1]),arr[2]
        while i<=n and ad!=0:
            if v2[i]+ad<=v1[i-1]:
                v2[i]+=ad;break
            ad-=v1[i-1]-v2[i];v2[i]=v1[i-1]
            US.merge(i,min(i+1,n));i+=1
            
        
