#include<bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint=modint998244353; //1000000007;
using ll=long long;
using pp=pair<int,int>;
#define sr string 
#define vc vector
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define pque priority_queue
#define bpc(a) __builtin_popcount(a)
struct s{ll a,b; int r;};
s op(s sa,s sb){
  s res;
  res.a=sa.a+sb.a; res.b=sa.b+sb.b; res.r=sa.r+sb.r;
  return res;
}
s e(){
  s res={0,0,0};
  return res;
}
s mapping(ll f,s x){
  x.b+=x.a*2*f+x.r*f*f;
  x.a+=f*x.r;
  return x;
}
ll comp(ll fa,ll fb){return fa+fb;}
ll id(){return 0ll;}
int main(){
  int n;cin>>n;
  lazy_segtree<s,op,e,ll,mapping,comp,id>sg(n);
  rep(i,n){
    ll a;cin>>a;
    sg.set(i,{a,a*a,1});
  }
  int q;cin>>q;
  rep(z,q){
    int t;cin>>t;
    if(t==1){
      ll l,r,x;cin>>l>>r>>x;
      sg.apply(l-1,r,x);
    }
    else{
      ll l,r;cin>>l>>r;
      s res=sg.prod(l-1,r);
      cout<<res.b<<"\n";
    }
  }
}