You are given circular array *a*<sub class="lower-index">0</sub>, *a*<sub class="lower-index">1</sub>, ..., *a*<sub class="lower-index">*n* - 1</sub>. There are two types of operations with it: 
 -  *inc*(*lf*, *rg*, *v*) — this operation increases each element on the segment [*lf*, *rg*] (inclusively) by *v*; -  *rmq*(*lf*, *rg*) — this operation returns minimal value on the segment [*lf*, *rg*] (inclusively). 
Assume segments to be circular, so if *n* = 5 and *lf* = 3, *rg* = 1, it means the index sequence: 3, 4, 0, 1.

Write program to process given sequence of operations.
The first line contains integer *n* (1 ≤ *n* ≤ 200000). The next line contains initial state of the array: *a*<sub class="lower-index">0</sub>, *a*<sub class="lower-index">1</sub>, ..., *a*<sub class="lower-index">*n* - 1</sub> ( - 10<sup class="upper-index">6</sup> ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">6</sup>), *a*<sub class="lower-index">*i*</sub> are integer. The third line contains integer *m* (0 ≤ *m* ≤ 200000), *m* — the number of operartons. Next *m* lines contain one operation each. If line contains two integer *lf*, *rg* (0 ≤ *lf*, *rg* ≤ *n* - 1) it means *rmq* operation, it contains three integers *lf*, *rg*, *v* (0 ≤ *lf*, *rg* ≤ *n* - 1; - 10<sup class="upper-index">6</sup> ≤ *v* ≤ 10<sup class="upper-index">6</sup>) — *inc* operation.
import math

def preprocess_rmq(arr,n):
    
    #Creando Sparse Table
    k = int(math.log2(n)) + 1
    st = [[0] * n for _ in range(k)]
    
    # Rellenando
    for i in range(n):
        st[0][i] = arr[i]
    
    for j in range(1, k):
        i = 0
        while (i + pow(2, (j - 1))) < n:
            st[j][i] = min(st[j-1][i], st[j-1][i + pow(2, (j - 1))])
            i += 1

    return st

def query_rmq(st, left, right):
    k = int(math.log2(right - left + 1))
    return min(st[k][left], st[k][right - pow(2, k) + 1])

# Lectura de la entrada
n = int(input())
arr = list(map(int, input().split()))
m = int(input())

# Realizar preprocesamiento
st = preprocess_rmq(arr,n)

# Procesar las operaciones
for _ in range(m):
    operation = list(map(int, input().split()))
    if len(operation) == 2:
        lf, rg = operation
        if lf <= rg:
            print(query_rmq(st, lf, rg))
        else:
            print(min(query_rmq(st, lf, n-1), query_rmq(st, 0, rg)))
    else:
        lf, rg, v = operation
        if lf <= rg:
            for i in range(lf, rg+1):
                arr[i] += v
        else:
            for i in range(lf, n):
                arr[i] += v
            for i in range(rg+1):
                arr[i] += v

            # Actualizar tabla Sparse Table después de modificaciones
            st = preprocess_rmq(arr,n)
