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.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.Calendar;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.SortedSet;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

/**
 * #
 * 
 * @author pttrung
 */
public class C_Round_1 {

	public static long MOD = 1000000007;

	public static void main(String[] args) throws FileNotFoundException {
		// PrintWriter out = new PrintWriter(new FileOutputStream(new File(
		// "output.txt")));
		PrintWriter out = new PrintWriter(System.out);
		Scanner in = new Scanner();
		int n = in.nextInt();
		Node root = new Node(0, n - 1);
		for (int i = 0; i < n; i++) {
			long v = in.nextInt();

			update(i, i, v, root);
		}

		int m = in.nextInt();
		// in.nextLine();
		for (int i = 0; i < m; i++) {
			String[] tmp = in.nextLine().split(" ");
			// System.out.println(Arrays.toString(tmp));
			if (tmp.length == 3) {
				int l = Integer.parseInt(tmp[0]);
				int r = Integer.parseInt(tmp[1]);
				long v = Integer.parseInt(tmp[2]);
				if (l > r) {
					updateAdd(l, n - 1, v, 0, root);
					updateAdd(0, r, v, 0, root);
				} else {
					updateAdd(l, r, v, 0, root);
				}
			} else {
				int l = Integer.parseInt(tmp[0]);
				int r = Integer.parseInt(tmp[1]);
				// System.out.println(l + " " + r);
				if (l > r) {
					long a = get(l, n - 1, 0, root);
					long b = get(0, r, 0, root);
					out.println((a > b ? b : a));
				} else {
					out.println(get(l, r, 0, root));
				}

			}

		}
		out.close();
	}

	static void print(Node node) {
		if (node == null) {
			return;
		}
		System.out.println("NODE " + node + " " + node.v + " " + node.add);
		print(node.left);
		print(node.right);
	}

	static long get(int l, int r, long pre, Node node) {

		if (node.l > r || node.r < l) {
			node.add += pre;
			node.v += pre;
			return Long.MAX_VALUE;
		}
		if (l <= node.l && node.r <= r) {
			node.add += pre;
			node.v += pre;
			return node.v;
		}
		pre += node.add;
		node.add = 0;
		long a = get(l, r, pre, node.left);
		long b = get(l, r, pre, node.right);
		long min = node.left.v > node.right.v ? node.right.v : node.left.v;
		node.v = min;
		return a > b ? b : a;
	}

	static void updateAdd(int l, int r, long v, long pre, Node node) {
		if (node.l > r || node.r < l) {
			node.add += pre;
			node.v += pre;
			return;
		}
		if (l <= node.l && node.r <= r) {
			node.add += (pre + v);
			node.v += (pre + v);
			return;
		}
		pre += node.add;
		node.add = 0;
		updateAdd(l, r, v, pre, node.left);
		updateAdd(l, r, v, pre, node.right);
		long min = node.left.v > node.right.v ? node.right.v : node.left.v;
		node.v = min;
	}

	static void update(int l, int r, long v, Node node) {
		if (node.l > r || node.r < l) {
			return;
		}
		if (l <= node.l && node.r <= r) {
			node.v = v;
			return;
		}
		int mid = (node.l + node.r) / 2;
		if (node.left == null) {
			node.left = new Node(node.l, mid);
		}
		update(l, r, v, node.left);
		if (node.right == null) {
			node.right = new Node(mid + 1, node.r);
		}
		update(l, r, v, node.right);
		long min = node.left.v > node.right.v ? node.right.v : node.left.v;
		node.v = min;
	}

	static class Node {

		int l, r;
		Node left = null, right = null;
		long v = Long.MAX_VALUE, add = 0;

		public Node(int l, int r) {
			this.l = l;
			this.r = r;
		}

		@Override
		public String toString() {
			return "Node{" + "l=" + l + ", r=" + r + ", v=" + v + ", add="
					+ add + '}';
		}
	}

	public static int[] KMP(String val) {
		int i = 0;
		int j = -1;
		int[] result = new int[val.length() + 1];
		result[0] = -1;
		while (i < val.length()) {
			while (j >= 0 && val.charAt(j) != val.charAt(i)) {
				j = result[j];
			}
			j++;
			i++;
			result[i] = j;
		}
		return result;

	}

	public static boolean nextPer(int[] data) {
		int i = data.length - 1;
		while (i > 0 && data[i] < data[i - 1]) {
			i--;
		}
		if (i == 0) {
			return false;
		}
		int j = data.length - 1;
		while (data[j] < data[i - 1]) {
			j--;
		}
		int temp = data[i - 1];
		data[i - 1] = data[j];
		data[j] = temp;
		Arrays.sort(data, i, data.length);
		return true;
	}

	public static int digit(long n) {
		int result = 0;
		while (n > 0) {
			n /= 10;
			result++;
		}
		return result;
	}

	public static double dist(long a, long b, long x, long y) {
		double val = (b - a) * (b - a) + (x - y) * (x - y);
		val = Math.sqrt(val);
		double other = x * x + a * a;
		other = Math.sqrt(other);
		return val + other;

	}

	public static class Point implements Comparable<Point> {

		int x, y;

		public Point(int start, int end) {
			this.x = start;
			this.y = end;
		}

		@Override
		public int hashCode() {
			int hash = 5;
			hash = 47 * hash + this.x;
			hash = 47 * hash + this.y;
			return hash;
		}

		@Override
		public boolean equals(Object obj) {
			if (obj == null) {
				return false;
			}
			if (getClass() != obj.getClass()) {
				return false;
			}
			final Point other = (Point) obj;
			if (this.x != other.x) {
				return false;
			}
			if (this.y != other.y) {
				return false;
			}
			return true;
		}

		@Override
		public int compareTo(Point o) {
			return x - o.x;
		}
	}

	public static class FT {

		long[] data;

		FT(int n) {
			data = new long[n];
		}

		public void update(int index, long value) {
			while (index < data.length) {
				data[index] += value;
				index += (index & (-index));
			}
		}

		public long get(int index) {
			long result = 0;
			while (index > 0) {
				result += data[index];
				index -= (index & (-index));
			}
			return result;

		}
	}

	public static long gcd(long a, long b) {
		if (b == 0) {
			return a;
		}
		return gcd(b, a % b);
	}

	public static long pow(long a, long b) {
		if (b == 0) {
			return 1;
		}
		if (b == 1) {
			return a;
		}
		long val = pow(a, b / 2);
		if (b % 2 == 0) {
			return val * val % MOD;
		} else {
			return val * (val * a % MOD) % MOD;

		}
	}

	static class Scanner {

		BufferedReader br;
		StringTokenizer st;

		public Scanner() throws FileNotFoundException {
			// System.setOut(new PrintStream(new
			// BufferedOutputStream(System.out), true));
			br = new BufferedReader(new InputStreamReader(System.in));
			// br = new BufferedReader(new InputStreamReader(new
			// FileInputStream(new File("input.txt"))));
		}

		public String next() {

			while (st == null || !st.hasMoreTokens()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (Exception e) {
					throw new RuntimeException();
				}
			}
			return st.nextToken();
		}

		public long nextLong() {
			return Long.parseLong(next());
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}

		public double nextDouble() {
			return Double.parseDouble(next());
		}

		public String nextLine() {
			st = null;
			try {
				return br.readLine();
			} catch (Exception e) {
				throw new RuntimeException();
			}
		}

		public boolean endLine() {
			try {
				String next = br.readLine();
				while (next != null && next.trim().isEmpty()) {
					next = br.readLine();
				}
				if (next == null) {
					return true;
				}
				st = new StringTokenizer(next);
				return st.hasMoreTokens();
			} catch (Exception e) {
				throw new RuntimeException();
			}
		}
	}
}
