Range Min With

#include <bits/stdc++.h>

using namespace std;

#define long long long int

struct SegmentTree {
private:
    struct Node {
        int sum, mx, snd_mx, cnt;

        Node(): sum(0), mx(0), snd_mx(0), cnt(0) {}
        Node(int sum, int mx, int snd_mx, int cnt):
            sum(sum), mx(mx), snd_mx(snd_mx), cnt(cnt) {}

        Node operator +(Node other) {
            int new_sum = sum + other.sum;

            int new_mx = mx, new_cnt = cnt;
            if (other.mx == mx) new_cnt += other.cnt;
            else if (other.mx > mx) {
                new_mx = other.mx;
                new_cnt = other.cnt;
            }

            int new_snd_mx = -1;
            if (mx > other.mx) new_snd_mx = max(snd_mx, other.mx);
            else if (mx < other.mx) new_snd_mx = max(mx, other.snd_mx);
            else new_snd_mx = max(snd_mx, other.snd_mx);

            return Node(new_sum, new_mx, new_snd_mx, new_cnt);
        }
    };

    int n;
    vector<int> a;
    vector<Node> tree;
    vector<int> lazy;

public:
    SegmentTree(int n, vector<int> &a) {
        this->n = n;
        this->a = a;

        tree.resize(4 * n);
        lazy.assign(4 * n, -1);
        build(1, 1, n);
    }

    void update(int l, int r, int x) {
        update(1, 1, n, l, r, x);
    }

    int query(int l, int r) {
        return query(1, 1, n, l, r);
    }

private:
    void merge(int node) {
        tree[node] = tree[2 * node] + tree[2 * node + 1];
    }

    void build(int node, int l, int r) {
        if (l == r) tree[node] = Node(a[l], a[l], -1, 1);
        else {
            int mid = (l + r) / 2;
            build(2 * node, l, mid);
            build(2 * node + 1, mid + 1, r);
            merge(node);
        }
    }

    void update_lazy(int node, int l, int r, int x) {
        if (x <= tree[node].mx) {
            tree[node].sum -= tree[node].cnt * (tree[node].mx - x);
            tree[node].mx = lazy[node] = x;
        }
    }

    void push_down(int node, int l, int r) {
        if (lazy[node] == -1) return;

        int mid = (l + r) / 2;
        update_lazy(2 * node, l, mid, lazy[node]);
        update_lazy(2 * node + 1, mid + 1, r, lazy[node]);
        lazy[node] = -1;
    }

    void update(int node, int l, int r, int ul, int ur, int x) {
        if (r < ul || l > ur || x > tree[node].mx) return;
        if (ul <= l && r <= ur && x > tree[node].snd_mx) {
            update_lazy(node, l, r, x);
            return;
        }

        push_down(node, l, r);

        int mid = (l + r) / 2;
        update(2 * node, l, mid, ul, ur, x);
        update(2 * node + 1, mid + 1, r, ul, ur, x);
        merge(node);
    }

    int query(int node, int l, int r, int ql, int qr) {
        if (r < ql || l > qr) return 0;
        if (ql <= l && r <= qr) return tree[node].sum;

        push_down(node, l, r);

        int mid = (l + r) / 2;
        return query(2 * node, l, mid, ql, qr) + query(2 * node + 1, mid + 1, r, ql, qr);
    }
};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n; cin >> n;

    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++)
        cin >> a[i];

    SegmentTree tree(n, a);

    int q; cin >> q;
    while (q--) {
        int op, l, r;
        cin >> op >> l >> r;

        if (op == 1) {
            int ans = tree.query(l, r);
            cout << ans << "\n";
        } else {
            int x; cin >> x;
            tree.update(l, r, x);
        }
    }
}