#include<bits/stdc++.h> using namespace std; #define N 100005 #define ll long long ll n,m,bl[N],b,a[N],tag[N]; void change(ll l,ll r,ll x) { for (int i=l; i<=min(bl[l]*b,r); i++) a[i]+=x; if (bl[l]!=bl[r]) for (int i=b*(bl[r]-1)+1; i<=r; i++) a[i]+=x; for (int i=bl[l]+1; i<=bl[r]-1; i++) tag[i]+=x; } int main() {scanf("%lld",&n); b=sqrt(n); for (int i=1; i<=n; i++)scanf("%lld",&a[i]),bl[i]=(i-1)/b+1; scanf("%lld",&m); while (m--) { ll st,l,r,x; cin>>st; if (st==1) { scanf("%lld%lld%lld",&l,&r,&x); change(l,r,x); } else { scanf("%lld",&x); printf("%lld\n",a[x]+tag[bl[x]]); } } return 0; }