#include using namespace std; #define F first #define S second #define R cin>> #define ll long long #define ln cout<<'\n' #define in(a) insert(a) #define pb(a) push_back(a) #define pd(a) printf("%.10f\n",a) #define mem(a) memset(a,0,sizeof(a)) #define all(c) (c).begin(),(c).end() #define iter(c) __typeof((c).begin()) #define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--) #define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++) #define rep(i,n) REP(i,0,n) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) ll check(ll n,ll m,ll x,ll y){return x>=0&&x=0&&yvoid pr(const A &a,const B&...b){cout<void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")< P; int N=1<<18; class StarrySkyTree{ public: ll Mi[555555],A[555555]; void init(){memset(Mi,0,sizeof(Mi)),memset(A,0,sizeof(A));} void add(int a,int b,ll x,int k=0,int l=0,int r=N) { if(r<=a||b<=l) return; if(a<=l&&r<=b){ A[k]+=x; while(k){ k=(k-1)/2; Mi[k]=min(Mi[k*2+1]+A[k*2+1],Mi[k*2+2]+A[k*2+2]); } return; } add(a,b,x,k*2+1,l,(l+r)/2); add(a,b,x,k*2+2,(l+r)/2,r); } ll getMin(int a,int b,int k=0,int l=0,int r=N) { if(r<=a||b<=l)return MAXL;if(a<=l&&r<=b)return Mi[k]+A[k]; ll left=getMin(a,b,k*2+1,l,(l+r)/2),right=getMin(a,b,k*2+2,(l+r)/2,r); return min(left,right)+A[k]; } }; StarrySkyTree t; void Main() { ll n; cin >> n; rep(i,n) { ll x; cin >> x; t.add(i,i+1,x); } ll T; cin >> T; while(T--) { ll z,l,r,x; cin >> z >> l >> r >> x; if(z==1) t.add(l-1,r,x); else pr(t.getMin(l-1,r)); } } int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}