#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>

using namespace std;

#define int long long
#define endl "\n"

constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007; 

struct fast_io {
	fast_io(){
		std::cin.tie(nullptr);
		std::ios::sync_with_stdio(false);
	};
} fio;

template<typename T>
class lazy_segment_tree{
	int n;
	T fval;
	vector<T> dat;
	vector<int>  lazy;
	
public:
	
	lazy_segment_tree(){
		
	}
	
	lazy_segment_tree(int n_, T val){
		init(n_, val);
	}
	
	~lazy_segment_tree(){
		
	}
	
	void init(int n_, T val){
		fval = val;
		
		n = 1;
		
		while(n < n_) n *= 2;
		
		dat.resize(2 * n - 1);
		lazy.resize(2 * n - 1, 0);
	
		for(int i = 0; i < 2 * n - 1; i++) dat[i] = fval;
	}
	
	void eval(int k, int l, int r){
		
		if(lazy[k] != 0){
			int x = lazy[k] / (r - l);
			
			dat[k] = {dat[k].first + 2 * dat[k].second * x + (r - l) * x * x, dat[k].second + (r - l) * x};
			
			if(r - l > 1) {
				lazy[2*k+1] = lazy[2*k+1] + lazy[k]/2;
				lazy[2*k+2] = lazy[2*k+2] + lazy[k]/2;
			}
			
			lazy[k] = 0;
		}
	}
	
	void update(int a, int b, int x, int k = 0, int l = 0, int r = -1){
		if(r < 0) r = n;
		eval(k, l, r);
		if(b <= l || r <= a) {return ;}
		if(a <= l && r <= b){
			lazy[k] = lazy[k] + (r - l) * x;
			eval(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);
			dat[k] = {dat[2*k+1].first + dat[2*k+2].first, dat[2*k+1].second + dat[2*k+2].second};
		}
	}
	
	T query(int a, int b, int k = 0, int l = 0, int r = -1){
		if(r < 0) r = n;
		eval(k, l, r);
		if(r <= a || b <= l){
			return fval;
		}
		if(a <= l && r <= b){
			return dat[k];
		}else {
			T vl = query(a, b, k * 2 + 1, l, (l + r) / 2 );
			T vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
			return {vl.first + vr.first, vl.second + vr.second};
		}
	}
};


signed main(){
	cout<<fixed<<setprecision(10);
	
	int N, Q;
	vector<int> A;
	lazy_segment_tree<pair<int,int>> lseg;
	
	cin>>N;
	
	A.resize(N);
	
	lseg.init(N+3, {0,0});
	
	for(int i = 0; i < N; i++){
		cin>>A[i];
		lseg.update(i+1, i+2, A[i]);
	}
	
	cin>>Q;
	
	for(int i = 0; i < Q; i++){
		int q;
		
		cin>>q;
		
		if(q == 1) {
			int l, r, x;
			
			cin>>l>>r>>x;
			
			lseg.update(l, r+1, x);
			
		} else {
			int l, r;
			
			cin>>l>>r;
			
			cout<<lseg.query(l, r+1).first<<endl;
		}
	}
	
	
	return 0;
}