#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)
#if DEBUG
#define debug(...) printf(__VA_ARGS__)
#else
#define debug(...) /* ... */
#endif
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 123450
#endif

int N,M,Q;

/********************************
 * 平方分割
 *******************************/
class SqrtDecomposition {
public:
    vector<int> A; // 全体に足される分
    vector<int> S; // Tの合計
    vector<int> S2; // T^2の合計
    vector<int> T; // 多い方
    int K;
    
    SqrtDecomposition(int size) {
        K = sqrt(size);
        T = vector<int>(size, 0);
        S = vector<int>(size/K+1, 0);
        S2 = vector<int>(size/K+1, 0);
        A = vector<int>(size/K+1, 0);
    }
    
    void udpate() {
        REP(i,T.size()) {
            int lk = i/K;
            S2[lk] += T[i]*T[i];
            S[lk] += T[i];
        }
    }
    
    void add(int l, int r, int w) {
        while(l < r) {
            int lk = l / K;
            int rk = r / K;
            if (lk == rk) {
                FOR(j, l, r) {
                    S2[lk] -= T[j]*T[j];
                    S[lk] += w;
                    T[j] += w;
                    S2[lk] += T[j]*T[j];
                }
            }
            else if (l % K == 0) {
                A[lk] += w;
            }
            else {
                FOR(j, l, (lk+1)*K) {
                    S2[lk] -= T[j]*T[j];
                    S[lk] += w;
                    T[j] += w;
                    S2[lk] += T[j]*T[j];
                }
            }
            l = (lk+1)*K;
        }
    }
    
    int query(int l, int r) {
        int ret = 0;
        while(l < r) {
            int lk = l / K;
            int rk = r / K;
            if (lk == rk) {
                FOR(j, l, r) {
                    int c = A[lk] + T[j];
                    ret += c*c;
                }
            }
            else if (l % K == 0) {
                int add = K*A[lk]*A[lk] + 2*A[lk]*S[lk]+S2[lk];
                ret += add;
            }
            else {
                FOR(j, l, (lk+1)*K) {
                    int c = A[lk] + T[j];
                    ret += c*c;
                }
            }
            l = (lk+1)*K;
        }
        return ret;
    }
};


void solve() {
    cin>>N;
    int a;
    auto sd = SqrtDecomposition(N);
    REP(i,N) {
        cin>>a;
        sd.T[i]=a;
    }
    sd.udpate();
    cin>>Q;
    int c,l,r,x;
    while(Q--) {
        cin>>c>>l>>r;
        if (c==1) {
            cin>>x;
            sd.add(--l, r, x);
        } else {
            out("%lld\n", sd.query(--l, r));
        }
    }
}