#include <bits/stdc++.h>
using namespace std;
using LL = long long int;
#define incID(i, l, r) for(int i = (l)    ; i <  (r); ++i)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); --i)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); ++i)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); --i)
#define inc(i, n)  incID(i, 0, n)
#define dec(i, n)  decID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second
#define FR front()
#define BA back()
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
auto setmin   = [](auto & a, auto b) { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };
#define SI(v) static_cast<int>(v.size())
#define RF(e, v) for(auto & e: v)
#define until(e) while(! (e))
#define if_not(e) if(! (e))
#define ef else if
#define UR assert(false)
#define IN(T, ...) T __VA_ARGS__; IN_(__VA_ARGS__);
void IN_() { };
template<typename T, typename ... U> void IN_(T &  a, U &  ... b) { cin >> a; IN_(b ...); };
template<typename T                > void OUT(T && a            ) { cout << a << endl; }
template<typename T, typename ... U> void OUT(T && a, U && ... b) { cout << a << " "; OUT(b ...); }

// ---- ----

template<typename T> istream & operator>>(istream & s, vector<T> & v) { RF(e, v) { s >> e; } return s; }
template<typename T> ostream & operator<<(ostream & s, vector<T> const & v) {
	inc(i, SI(v)) { s << (i == 0 ? "" : " ") << v[i]; }
	return s;
}

int main() {
	IN(int, n);
	vector<LL> a(n);
	cin >> a;
	
	const int L = 200;
	until(SI(a) % L == 0) { a.PB(0); }
	const int B = SI(a) / L;
	vector<LL> sx(B), s1(B), s2(B);
	inc(i, n) {
		s1[i / L] += a[i];
		s2[i / L] += a[i] * a[i];
	}
	
	IN(int, Q);
	inc(q, Q) {
		IN(int, t, i, r);
		i--;
		if(t == 1) {
			IN(LL, x);
			until(i == r) {
				if(i % L == 0 && i + L <= r) {
					sx[i / L] += x;
					i += L;
				} else {
					s1[i / L] -= a[i];
					s2[i / L] -= a[i] * a[i];
					a[i] += x;
					s1[i / L] += a[i];
					s2[i / L] += a[i] * a[i];
					i++;
				}
			}
		} else {
			LL ans = 0;
			until(i == r) {
				if(i % L == 0 && i + L <= r) {
					auto SX = sx[i / L];
					auto S1 = s1[i / L];
					auto S2 = s2[i / L];
					ans += L * SX * SX + 2 * SX * S1 + S2;
					i += L;
				} else {
					LL A = a[i] + sx[i / L];
					ans += A * A;
					i++;
				}
			}
			OUT(ans);
		}
	}
}