#ifndef LOCAL
#include <bits/stdc++.h>

using namespace std;

#define debug(...) (void(0))
#else
#include "algo/debug.h"
#endif

#include <atcoder/lazysegtree>

struct S {
    int64_t sum, sum2, sz;
};
S op(S a, S b) {
    return S{
        a.sum + b.sum,
        a.sum2 + b.sum2,
        a.sz + b.sz,
    };
};
S e() {
    return S{0, 0, 0};
}
using F = int64_t;
F id() { return 0; }
S mapping(F f, S x) {
    return S{
        x.sum + f * x.sz,
        x.sum2 + 2 * f * x.sum + f * f * x.sz,
        x.sz,
    };
}
F composition(F f, F g) {
    return f + g;
}
void solve() {
    int N;
    cin >> N;
    vector<S> A(N);
    for (int i = 0; i < N; i++) {
        int64_t a;
        cin >> a;
        A[i] = S{a, a * a, 1};
    }
    atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> seg(A);
    int Q;
    cin >> Q;
    while (Q--) {
        int o;
        cin >> o;
        int l, r;
        cin >> l >> r;
        if (o == 1) {
            int64_t x;
            cin >> x;
            seg.apply(--l, r, x);
        } else {
            S ans = seg.prod(--l, r);
            cout << ans.sum2 << endl;
        }
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int tt = 1;
    // std::cin >> tt;
    while (tt--) {
        solve();
    }
}