#include<bits/stdc++.h>
using namespace std;
#include<atcoder/lazysegtree>
using ll=long long;
struct S{
	ll sqr,sum,len;
};
int main(){
	int N;cin>>N;
	vector<S> init(N);
	for(int i=0;i<N;i++){
		ll a;cin>>a;
		init[i]={a*a,a,1};
	}
	atcoder::lazy_segtree<S,
												[](S a,S b){return S{a.sqr+b.sqr,a.sum+b.sum,a.len+b.len};},
												[]{return S{0,0,0};},
												ll,
												[](ll f,S x){return S{x.sqr+x.sum*f*2+f*f,x.sum+f*x.len,x.len};},
												[](ll f,ll g){return f+g;},
												[]{return 0;}> seg(init);
	int Q;cin>>Q;
	while(Q--){
		ll com,l,r,x;
		cin>>com>>l>>r;
		l--;
		if(com==1){
			cin>>x;
			seg.apply(l,r,x);
		}
		else if(com==2){
			cout<<seg.prod(l,r).sqr<<endl;
		}
	}
}