import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
import java.util.Stack;

class Main {
	public static void main(String[] $) {
		new Main().run();
	}
	
	class Seg {
		int n=1;
		long[] v;
		long[] lazy;
		final long INF=Long.MAX_VALUE/3;
		
		public Seg(int n_) {
			while (n<n_)n*=2;
			v=new long[2*n-1];
			lazy=new long[2*n-1];
		}
		
		void push(int k) {
			v[k]+=lazy[k];
			if (2*k+1<v.length) {
				lazy[2*k+1]+=lazy[k];
				lazy[2*k+2]+=lazy[k];
			}
			lazy[k]=0;
		}
		
		long query(int a,int b,long add) {
			return query(0,n,a,b,0,add);
		}
		
		long query(int l,int r,int a,int b,int k,long add) {
			push(k);
			if (b<=l||r<=a) return INF;
			if (a<=l&&r<=b) {
				lazy[k]+=add;
				push(k);
				return v[k];
			}
			long vl=query(l,(l+r)/2,a,b,2*k+1,add);
			long vr=query((l+r)/2,r,a,b,2*k+2,add);
			v[k]=Math.min(v[2*k+1], v[2*k+2]);
			return Math.min(vl, vr);
		}
	}
	
	void run() {
		Scanner sc=new Scanner(System.in);
		PrintWriter pw=new PrintWriter(System.out);
		int N=sc.nextInt();
		Seg seg=new Seg(N);
		for (int i=0;i<N;++i) {
			long a=sc.nextLong();
			seg.query(i, i+1, a);
		}
		int Q=sc.nextInt();
		for (int q=0;q<Q;++q) {
			int k=sc.nextInt();
			int l=sc.nextInt()-1;
			int r=sc.nextInt()-1;
			int c=sc.nextInt();
			if (k==1) {
				seg.query(l, r+1, c);
			} else {
				pw.println(seg.query(l, r+1, 0));
			}
		}
		pw.flush();
	}
	
	void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));}
}