1 #include <cstdio>
 2 #include <cstring>
 3 #include <iostream>
 4 #include <algorithm>
 5 #define N 200100*8
 6 using namespace std;
 7 typedef long long ll;
 8 int n,m;
 9 ll a[N],c1[N],c2[N];
10 struct io{
11     char op[1<<26],*s;
12     io()
13     {
14         fread(s=op,1,1<<26,stdin);
15     }
16     inline int read()
17     {
18         register int u=0;
19         while(*s<48)s++;
20         while(*s>32)u=u*10+*s++-48;
21         return u;
22     }
23 }ip;
24 #define read ip.read
25 inline int lowbit(int x){return x&(-x);}
26 void add(ll *r,int pos, ll v)
27 {
28     for(;pos<=n;pos+=lowbit(pos))r[pos]+=v;
29 }
30 ll getsum(ll *r,int pos)
31 {
32     ll re=0;
33     for(;pos>0;pos-=lowbit(pos))re+=r[pos];
34     return re;
35 }
36 ll sigma(int r)
37 {
38     ll sum1=r*getsum(c1,r),sum2=getsum(c2,r);
39     return sum1-sum2;
40 }
41 ll query(int x,int y)
42 {
43     return sigma(y)-sigma(x-1);
44 }
45 int flag,x,y;ll k;
46 int main()
47 {
48     n=read();
49     for(int i=1;i<=n;i++)
50     {
51         a[i]=read();
52         add(c1,i,a[i]-a[i-1]);
53         add(c2,i,(i-1)*(a[i]-a[i-1]));
54     }m=read();
55     for(int i=1;i<=m;i++)
56     {
57         flag=read();
58         if(flag==1)
59         {
60             x=read();y=read();k=read();
61             add(c1,x,k);add(c1,y+1,-k);
62             add(c2,x,(x-1)*k);add(c2,y+1,y*(-k));
63         }
64         else
65         {
66             x=read();y=read();
67             printf("%lld\n",query(x,y));
68         }
69     }
70     return 0;
71 }