#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

struct nd{
    ll sum;
    ll sum_pow;
};

nd unit_nd = (nd){0, 0};

template <typename T>
struct LazySegmentTree {
    int n;
    T unit;
    vector<T> node;
    vector<ll> lazy;
    vector<bool> lazyFlag;

    T calc(T a, T b){
        T ans;
        ans.sum = a.sum+b.sum;
        ans.sum_pow = a.sum_pow+b.sum_pow;
        return ans;
    }

    T lazyEvaluateNode(T node, ll lazy, int d){
        T ans;
        ans.sum = node.sum + d*lazy;
        ans.sum_pow = node.sum_pow+2*node.sum*lazy+d*lazy*lazy;
        return ans; //適宜変える
    }

    ll clearLazy(){
        return 0; //適宜変える
    }

    LazySegmentTree(vector<T> v, T UNIT) {
        int sz = (int)v.size();
        unit = UNIT;
        n = 1; while(n < sz) n *= 2;
        node.resize(2*n-1, UNIT);
        lazy.resize(2*n-1, 0);
        lazyFlag.resize(2*n-1, false);

        for(int i=0; i<sz; i++) node[i+n-1] = v[i];
        for(int i=n-2; i>=0; i--) node[i] = calc(node[i*2+1], node[i*2+2]);
    }

    void lazyEvaluate(int k, int l, int r) {
        if(lazyFlag[k]) {
            node[k] = lazyEvaluateNode(node[k], lazy[k], r-l);
            if(r - l > 1) {
                lazy[k*2+1] = lazy[k*2+1]+lazy[k];
                lazy[k*2+2] = lazy[k*2+2]+lazy[k];
                lazyFlag[k*2+1] = lazyFlag[k*2+2] = true;
            }
            lazyFlag[k] = false;
            lazy[k] = clearLazy();
        }
    }

    //[a, b)
    //区間[a, b]への更新に対してはupdate(a, b+1, x)と呼ぶ
    void update(int a, int b, ll x, int k=0, int l=0, int r=-1) {
        if(r < 0) r = n;
        lazyEvaluate(k, l, r);
        if(b <= l || r <= a) return;
        if(a <= l && r <= b) {
            lazy[k] += x;
            lazyFlag[k] = true;
            lazyEvaluate(k, l, r);
        }
        else {
            update(a, b, x, 2*k+1, l, (l+r)/2);
            update(a, b, x, 2*k+2, (l+r)/2, r);
            node[k] = calc(node[2*k+1], node[2*k+2]);
        }
    }

    //[a, b)
    //区間[a, b]へのクエリに対してはquery(a, b+1)と呼ぶ
    T query(int a, int b, int k=0, int l=0, int r=-1) {
        if(r < 0) r = n;
        lazyEvaluate(k, l, r);
        if(b <= l || r <= a) return unit;
        if(a <= l && r <= b) return node[k];
        T vl = query(a, b, 2*k+1, l, (l+r)/2);
        T vr = query(a, b, 2*k+2, (l+r)/2, r);
        return calc(vl, vr);
    }
};

int N;

nd calc(ll m){
    return (nd){m, m*m};
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    cin >> N;
    vector<nd> v;
    for(int i = 0; i < N; i++){
        ll A;
        cin >> A;
        v.push_back(calc(A));
    }
    
    LazySegmentTree<nd> sgt(v, unit_nd);
    // cout << "=======" << endl;
    int Q; cin >> Q;
    for(int i = 0; i < Q; i++){
        int c, l, r, x;
        cin >> c;
        if(c == 1){
            cin >> l >> r >> x;
            l--; r--;
            sgt.update(l, r+1, x);
            // for(int j = 0; j < N; j++) cout << sgt.query(j, j+1).sum << ' ' << sgt.query(j, j+1).sum_pow << endl;
            // cout << "=======" << endl;
        }else{
            cin >> l >> r;
            l--; r--;
            auto q = sgt.query(l, r+1);
            cout << q.sum_pow << endl;
        }
    }
}