#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 

typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};

#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

struct S{
    ll a2, a, sz;
};
S op(S lhs, S rhs){
    lhs.a2 += rhs.a2;
    lhs.a  += rhs.a;
    lhs.sz += rhs.sz;
    return lhs;
};
S e(){
    return S{0, 0, 0};
}
using F = ll;
S mapping(F f, S x){
    return S{
        x.a2 + 2LL * f * x.a + x.sz * f * f,
        x.a  + x.sz * f,
        x.sz
    };
}
F composition(F f, F g){
    return f + g;
}
F id(){
    return 0LL;
}


int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int N; cin >> N;
    vector<ll> A(N);
    rep(i, N) cin >> A[i];

    vector<S> dat(N);
    rep(i, N) dat[i] = S{A[i] * A[i], A[i], 1LL};
    lazy_segtree<S,op,e,F,mapping,composition,id> seg(dat);


    int Q; cin >> Q;
    while(Q--){
        int f, l, r; cin >> f >> l >> r; l--;
        if(f == 1){
            ll x; cin >> x;
            seg.apply(l, r, x);
        }
        else{
            cout << seg.prod(l, r).a2 << endl;
        }
    }
}