#include<stdio.h>
long long int seg[400005], ss, segseg[400005];
long long int min(long long int a, long long int b)
{
	if (a < b)
		return a;
	else
		return b;
}
void set1(long long int k)
{
	seg[k] += segseg[k];
	if (2 * k + 2 < 2 * ss - 1)
	{
		segseg[2 * k + 1] += segseg[k];
		segseg[2 * k + 2] += segseg[k];
	}
	segseg[k] = 0;
	while (k > 0)
	{
		k = (k - 1) / 2;
		seg[k] = min(seg[2 * k + 1], seg[2 * k + 2]);
	}
	return;
}
void set(long long int l, long long int r, long long int v, long long int k, long long int left, long long int right)
{
	if (l <= left && right <= r + 1)
	{
		segseg[k] += v;
		set1(k);
		return;
	}
	if (r < left || right <= l)
		return;
	set(l, r, v, 2 * k + 1, left, (left + right) / 2);
	set(l, r, v, 2 * k + 2, (left + right) / 2, right);
	return;
}
long long int get(long long int l, long long int r, long long int k, long long int left, long long int right)
{
	seg[k] += segseg[k];
	if (2 * k + 2 < 2 * ss - 1)
	{
		segseg[2 * k + 1] += segseg[k];
		segseg[2 * k + 2] += segseg[k];
	}
	segseg[k] = 0;
	if (right <= l)
		return 1000000000000000000;
	if (left > r)
		return 1000000000000000000;
	if (l <= left && right <= r + 1)
	{
		set1(k);
		return seg[k];
	}
	long long int v1 = get(l, r, 2 * k + 1, left, (left + right) / 2);
	long long int v2 = get(l, r, 2 * k + 2, (left + right) / 2, right);
	return min(v1, v2);
}
int main()
{
	long long int n;
	scanf("%lld", &n);
	long long int i;
	long long int a[100005];
	for (i = 0; i < n; i++)
		scanf("%lld", &a[i]);
	long long int q;
	scanf("%lld", &q);
	ss = 1;
	while (ss < n)
		ss *= 2;
	for (i = 0; i < 2 * ss - 1; i++)
	{
		seg[i] = 1000000000000000000;
		segseg[i] = 0;
	}
	for (i = 0; i < n; i++)
		seg[i + ss - 1] = a[i];
	for (i = ss - 2; i >= 0; i--)
		seg[i] = min(seg[2 * i + 1], seg[2 * i + 2]);
	long long int k, l, r, c;
	for (i = 0; i < q; i++)
	{
		scanf("%lld %lld %lld %lld", &k, &l, &r, &c);
		l--;
		r--;
		if (k == 1)
			set(l, r, c, 0, 0, ss);
		else
			printf("%lld\n", get(l, r, 0, 0, ss));
	}
	return 0;
}