#include<iostream>
using namespace std;
#include<cstdio>
#include<cstring>
struct Tree{
int l,r;
long long int sum;
};
Tree tree[100000*2+100];
int n,m;
int w[100001];
void input()
{
scanf("%d",&n);
for(int i=1;i<=n;++i)
{
int x;
scanf("%d",&x);
w[i]=w[i-1]+x;
}
}
void add(int i,int l,int r,int x)
{
if(l<=tree[i].l&&tree[i].r<=r)
{
tree[i].sum+=(tree[i].r-tree[i].l+1)*x;
}
if(tree[i].l==tree[i].r) return ;
int mid=(tree[i].l+tree[i].r)/2;
if(l<=mid) add(i*2,l,r,x);
if(r>mid) add(i*2+1,l,r,x);
}
int query(int i,int k)
{
if(tree[i].l==tree[i].r) return tree[i].sum;
int mid=(tree[i].l+tree[i].r)/2;
if(k<=mid) return query(i*2,k);
if(k>mid) return query(i*2+1,k);
}
void build(int i,int l,int r)
{
tree[i].l=l;tree[i].r=r;
tree[i].sum=w[r]-w[l-1];
if(l==r) return ;
int mid=(l+r)/2;
build(i*2,l,mid);
build(i*2+1,mid+1,r);
}
int main()
{
input();
build(1,1,n);
scanf("%d",&m);
int x,y,z;
int pp;
for(int i=1;i<=m;++i)
{
scanf("%d",&pp);
if(pp==1)
{
scanf("%d%d%d",&x,&y,&z);
add(1,x,y,z);
}
else {
scanf("%d",&x);
printf("%d\n",query(1,x));
}
}
return 0;
}