#include using namespace std; #define rep(i,n) for(int i = 0; i < (n);i++) #define sz(x) int(x.size()) typedef long long ll; typedef long double ld; typedef pair P; constexpr ll INF = (1LL << 60); template struct LazySegmentTree { int n; vector node, lazy; LazySegmentTree (int sz, T init = 0) { n = 1; while (n < sz) n <<= 1; node.assign(2*n, init); lazy.assign(2*n, 0); /*区間加算の時は0*/ } void eval (int k) { if (lazy[k] == 0) return ; node[k] += lazy[k]; /*区間加算に注意*/ if (k < n) { lazy[2*k+1] = lazy[k]; lazy[2*k+2] = lazy[k]; } lazy[k] = 0; } void update(int a, int b, T x, int k = 0, int l = 0, int r = -1) { eval(k); if (r < 0) r = n; if (b <= l || r <= a) return ; if (a <= l && r <= b) { lazy[k] = x; eval(k); } else { update(a, b, x, 2*k+1, l, (r+l)/2); update(a, b, x, 2*k+2, (r+l)/2, r); node[k] = min(node[2*k+1], node[2*k+2]); } } T query(int a, int b, int k = 0, int l = 0, int r = -1) { eval(k); if (r < 0) r = n; if (r <= a || b <= l) return INF; if (a <= l && r <= b) return node[k]; T vl = query(a, b, 2*k+1, l, (l+r)/2); T vr = query(a, b, 2*k+2, (l+r)/2, r); return min(vl, vr); } }; int main() { int n; cin >> n; LazySegmentTree seg(n); rep(i,n) { ll a; cin >> a; seg.update(i, i + 1, a); } int q; cin >> q; while (q--) { int k, l, r, c; cin >> k >> l >> r >> c; l--; if (k == 1) seg.update(l, r, c); else { //cout << "ans "; cout << seg.query(l, r) << endl; } } return 0; }