#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

struct S {
    long long sum2, sum1, size;
    
    S(long long sum2_, long long sum1_, long long size_) : 
    sum2(sum2_), sum1(sum1_), size(size_) {}
};

S op(S l, S r) {
    S res(l.sum2 + r.sum2, l.sum1 + r.sum1, l.size + r.size);
    return res;
}

S e() {
    S res(0LL, 0LL, 1LL);
    return res;
}

S mapping(long long x, S s) {
    S res(s.sum2 + 2LL * x * s.sum1 + s.size * x * x, s.sum1 + s.size * x, s.size);
    return res;
}

long long composition(long long f, long long g) {
    return f + g;
}

long long id() {
    return 0LL;
}

int main() {
    int n;
    cin >> n;
    vector<long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    lazy_segtree<S, op, e, long long, mapping, composition, id> seg(n);
    for (int i = 0; i < n; i++) {
        seg.set(i, {a[i] * a[i], a[i], 1LL});
    }
    int q;
    cin >> q;
    while (q--) {
        int t;
        cin >> t;
        if (t == 1) {
            int l, r;
            long long x;
            cin >> l >> r >> x;
            l--;
            seg.apply(l, r, x);
        } else {
            int l, r;
            cin >> l >> r;
            l--;
            cout << seg.prod(l, r).sum2 << endl;
        }
    }
}