import sys
input = sys.stdin.buffer.readline


class RmQ_RAQ:
    def __init__(self, n, INF=10**24):
        self.n = n
        self.e_add = 0
        self.e_min = INF
        self.node_add = [self.e_add for _ in range(n + n)]
        self.node_min = [0 for _ in range(n + n)]  # 各項を0で初期化

    def build(self, array):
        self.node_add = [self.e_add for _ in range(n + n)]
        for i, val in enumerate(array, self.n):
            self.node_min[i] = val
        for i in range(self.n - 1, 0, -1):
            self.node_min[i] = min(self.node_min[i << 1], self.node_min[i << 1 | 1])

    def _update(self, i, val):
        i += self.n
        self.node_add[i] += val
        self.node_min[i] += val
        while i > 1:
            i >>= 1
            self.node_add[i] += val
            self.node_min[i] = min(self.node_min[i << 1], 
                                   self.node_min[i << 1 | 1] + self.node_add[i << 1])

    def _fold_add(self, l, r):
        l, r = l + self.n, r + self.n
        add = self.e_add
        while l < r:
            if l & 1:
                add += self.node_add[l]
                l += 1
            if r & 1:
                r -= 1
                add += self.node_add[r]
            l, r = l >> 1, r >> 1
        return add

    def _fold_min(self, l, r):
        l, r = l + self.n, r + self.n
        add_l, add_r = self.e_add, self.e_add
        min_l, min_r = self.e_min, self.e_min
        while l < r:
            if l & 1:
                min_l = min(min_l, (self.node_min[l] + add_l))
                add_l += self.node_add[l]
                l += 1
            if r & 1:
                r -= 1
                min_r = min(self.node_min[r], (min_r + self.node_add[r]))
                add_r += self.node_add[r]
            l, r = l >> 1, r >> 1
        return min(min_l, min_r + add_l)

    def min(self, l, r):
        return self._fold_add(0, l) + self._fold_min(l, r)

    def add(self, l, r, val):
        self._update(l, val)
        if r < self.n:
            self._update(r, -val)


n = int(input())
a = list(map(int, input().split()))
q = int(input())
queries = [list(map(int, input().split())) for _ in range(q)]


rmq = RmQ_RAQ(n)
rmq.build(a)
ans = []
for k, l, r, c in queries:
    if k == 1:
        rmq.add(l - 1, r, c)
    else:
        ans.append(rmq.min(l - 1, r))

print("\n".join(map(str, ans)))