You are given circular array a0, a1, ..., an - 1. 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.

Input

The first line contains integer n (1 ≤ n ≤ 200000). The next line contains initial state of the array: a0, a1, ..., an - 1 ( - 106 ≤ ai ≤ 106), ai 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; - 106 ≤ v ≤ 106) — inc operation.

Output

For each rmq operation write result for it. Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cout (also you may use %I64d).

Examples

Input

4
1 2 3 4
4
3 0
3 0 -1
0 1
2 1


Output

1
0
0
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class CircularRMQ {
	static SegmentTree tree;
	static int N;
	static int n;

	public static void main(String[] args) throws IOException {
		StringTokenizer st;
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw=new PrintWriter(System.out);
		st = new StringTokenizer(br.readLine());
		n = Integer.parseInt(st.nextToken());

		N = 1;
		while (N < n)
			N <<= 1;

		long[] in = new long[N + 1];
		Arrays.fill(in, Long.MAX_VALUE);
		st = new StringTokenizer(br.readLine());

		for (int i = 1; i <= n; i++)
			in[i] = Integer.parseInt(st.nextToken());

		tree = new SegmentTree(in);
		st = new StringTokenizer(br.readLine());

		int m = Integer.parseInt(st.nextToken());

		for (int i = 0; i < m; i++) {
			st = new StringTokenizer(br.readLine());
			if (2 == st.countTokens()) {
				int l = Integer.parseInt(st.nextToken()) + 1;
				int r = Integer.parseInt(st.nextToken()) + 1;
				pw.println(rmq(l, r));
			} else {
				int l = Integer.parseInt(st.nextToken()) + 1;
				int r = Integer.parseInt(st.nextToken()) + 1;
				int v = Integer.parseInt(st.nextToken());
				inc(l, r, v);
			}

		}

		pw.flush();
	}

	public static void inc(int l, int r, int v) {
		if (l <= r)
			tree.update_range(l, r, v);
		else {
			tree.update_range(1, r, v);
			tree.update_range(l, n, v);
//			System.out.println("1 to " + r + " " + l + " to " + n);
		}
	}

	public static long rmq(int l, int r) {
		long q = 0;
		if (l <= r)
			q = tree.query(l, r);
		else
			q = Math.min(tree.query(1, r), tree.query(l, n));

		return q;
	}

	static class SegmentTree {

		int N;
		long[] array, sTree, lazy;

		SegmentTree(long[] in) {
			array = in;
			N = in.length - 1;
			sTree = new long[N << 1]; // big array akher N elements mnha homa in[]
			lazy = new long[N << 1];
			build(1, 1, N);
		}

		void build(int node, int b, int e) {
			if (b == e)
				sTree[node] = array[b];
			else {
				int mid = b + e >> 1;
				build(node << 1, b, mid);
				build(node << 1 | 1, mid + 1, e);
				sTree[node] = Math.min(sTree[node << 1], sTree[node << 1 | 1]);
			}
		}

		void update_range(int i, int j, int val) {
			update_range(1, 1, N, i, j, val);
		}

		void update_range(int node, int b, int e, int i, int j, int val) {
			if (i > e || j < b)
				return;

			if (b >= i && e <= j) {
				sTree[node] += val;
				lazy[node] += val;
			} else {
				int mid = b + e >> 1;
				propagate(node, b, mid, e);
				update_range(node << 1, b, mid, i, j, val);
				update_range(node << 1 | 1, mid + 1, e, i, j, val);
				sTree[node] = Math.min(sTree[node << 1], sTree[node << 1 | 1]);
			}

		}

		void propagate(int node, int b, int mid, int e) {
			lazy[node << 1] += lazy[node];
			lazy[node << 1 | 1] += lazy[node];
			sTree[node << 1] += lazy[node];
			sTree[node << 1 | 1] += lazy[node];
			lazy[node] = 0;
		}

		long query(int i, int j) {
			return query(1, 1, N, i, j);
		}

		long query(int node, int b, int e, int i, int j) {
			if (i > e || j < b)
				return Long.MAX_VALUE;

			if (b >= i && e <= j)
				return sTree[node];

			int mid = b + e >> 1;
			propagate(node, b, mid, e);
			long q1 = query(node << 1, b, mid, i, j);
			long q2 = query(node << 1 | 1, mid + 1, e, i, j);
			return Math.min(q1, q2);

		}

	}

}
