#include <bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vvvvll = vector<vvvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vvvvb = vector<vvvb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
#define all(A) A.begin(),A.end()
#define ALL(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
using pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;

template<class T>
bool chmax(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

template<class T>
bool chmin(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

ll gcd(ll(a), ll(b)) {
    if (b == 0)return a;
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}

struct S {
    ll a, size;
};
struct F {
    ll a, b;
};

S op(S l, S r) { return S{ min(l.a,r.a), l.size + r.size}; }

S e() { return S{ ll(1e18), 0 }; }

S mapping(F l, S r) { return S{ r.a * l.a + r.size * l.b, r.size }; }

F composition(F l, F r) { return F{ r.a * l.a, r.b * l.a + l.b }; }

F id() { return F{ 1, 0 }; }

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll N;
    cin >> N;
    vll A(N);
    rep(i, N)cin >> A[i];
    lazy_segtree<S, op, e, F, mapping, composition, id> seg(N);
    rep(i, N) {
        seg.set(i, S{ A[i],1 });
    }
    ll Q;
    cin >> Q;
    rep(q, Q) {
        ll K, L, R, C;
        cin >> K >> L >> R >> C;
        if (K == 1) {
            seg.apply(L - 1, R, F{ 1,C });
        }
        else {
            cout << seg.prod(L - 1, R).a << endl;
        }
    }
}