class LazySegmentTree:
	def __init__(self, n):
		tmp = 0
		while n != 0:
			n >>= 1
			tmp += 1
		self.nibeki = tmp
		self.seglen = 1<<tmp
		self.inf = (1<<63)-1
		self.seg = [0]*(self.seglen*2)
		self.lazy = [0]*(self.seglen*2)
	
	def gindex(self, l, r):
		L = l+self.seglen
		R = r+self.seglen
		lm = (L//(L&-L))>>1
		rm = (R//(R&-R))>>1
		while L < R:
			if R <= rm:
				yield R
			if L <= lm:
				yield L
			L >>= 1
			R >>= 1
		while L:
			yield L
			L >>= 1
	
	def propagates(self, *ids):
		for i in reversed(ids):
			v = self.lazy[i]
			if v is None:
				continue
			self.lazy[2*i] += v
			self.lazy[2*i+1] += v
			self.seg[2*i] += v
			self.seg[2*i+1] += v
			self.lazy[i] = 0
	
	def update(self, l, r, val):
		# [l, r)
		*ids, = self.gindex(l, r)
		self.propagates(*ids)
		L = l+self.seglen
		R = r+self.seglen
		while L < R:
			if L&1:
				self.lazy[L] += val
				self.seg[L] += val
				L += 1
			if R&1:
				R -= 1
				self.lazy[R] += val
				self.seg[R] += val
			L >>= 1
			R >>= 1
		for i in ids:
			self.seg[i] = min(self.seg[2*i], self.seg[2*i+1])
	
	def query(self, l, r):
		self.propagates(*self.gindex(l, r))
		L = l+self.seglen
		R = r+self.seglen
		s = self.inf
		while L < R:
			if L&1:
				s = min(s, self.seg[L])
				L += 1
			if R&1:
				R -= 1
				s = min(s, self.seg[R])
			L >>= 1
			R >>= 1
		return s

N = int(input())
a = list(map(int,input().split()))

lazyseg = LazySegmentTree(N)

tmp = 0
for i in range(N):
	lazyseg.update(i, i+1, a[i])

Q = int(input())
for _ in range(Q):
	k,l,r,c = map(int,input().split())
	if k == 1:
		lazyseg.update(l-1, r, c)
	else:
		print(lazyseg.query(l-1, r))