#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC

const int N = 2e5+7;
int sum[N << 2], sum2[N << 2], prop[N << 2];

void gap(int v, int x, int tl, int tr) {

    if (tl == 4 && tr == 4) {
        //cout << sum[v] << ' ' << sum2[v] << ' ' << x << endl;
    }   

    int len = tr - tl + 1;
    sum2[v] += x * x * len;
    sum2[v] += 2 * x * sum[v];

    sum[v] += x * len;

    prop[v] += x;

    if (tl == 4 && tr == 4) {
        //cout << "res " << sum[v] << ' ' << sum2[v] << endl;
    }   
}

void push(int v, int tl, int tr) {
    int tm = (tl + tr)>>1;
    gap(v * 2 + 1, prop[v], tl, tm);
    gap(v * 2 + 2, prop[v], tm+1, tr);
    prop[v] = 0;
}   

void relax(int v) {
    sum[v] = sum[v * 2 + 1] + sum[v * 2 + 2];
    sum2[v] = sum2[v * 2 + 1] + sum2[v * 2 + 2];
}   

void upd(int v, int tl, int tr, int l, int r, int x) {
    if (tr < l || r < tl)
        return;
    if (l <= tl && tr <= r) {
        gap(v, x, tl, tr);

        //cout << x << " : " << tl << ' ' << tr << ' ' << sum[v] << ' ' << sum2[v] << endl;

        return;
    }   
    int tm = (tl + tr) >> 1;
    push(v, tl, tr);
    upd(v * 2 + 1, tl, tm, l, r, x);
    upd(v * 2 + 2, tm + 1, tr, l, r, x);
    relax(v);
}   
int get(int v, int tl, int tr, int l, int r) {
    if (tr < l || r < tl)
        return 0;
    if (l <= tl && tr <= r) {
        //cout << tl << ' ' << tr << " : " << sum2[v] << endl;
        return sum2[v];
    }
    int tm = (tl + tr) >> 1;
    push(v, tl, tr);
    return get(v * 2 + 1, tl, tm, l, r) + get(v * 2 + 2, tm + 1, tr, l, r);    
}   

signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif

    int n;
    cin >> n;
    vector <int> a(n+1);
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        upd(0, 1, n, i, i, a[i]);
    }

    int q;
    cin >> q;
    while (q--) {
        int t, l, r;
        cin >> t >> l >> r;
        if (t == 2) {
            cout << get(0, 1,n, l, r) << endl;
        }   
        else {
            int x; cin >> x;
            upd(0, 1, n, l, r, x);
        }   
    }

}