#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e5+10;
const int _N = 500;
int n, m; int q, num;
ll a[N];
ll sum[_N], lazy[_N];
void init()
{
    q = sqrt(n), num = q+(q*q<n);
    for (int i=1;i<=n;++i)
    {
        sum[i/q-(i%q==0)]+=a[i];
    }
    //for (int i=0;i<num;++i)printf("%d ", sum[i]); printf("\n");
}
void change(int l, int r, int v)
{
    int i1 = l/q, i2 = r/q;
    int m1 = l%q, m2 = r%q;
    int p1 = i1+(m1!=0&&m1!=1), p2 = i2-1;
    for (int i=p1;i<=p2;++i)
        lazy[i] += v;
    for (int i=l;i<=p1*q&&i<=r;++i)
    {
        a[i]+=v;
        sum[i/q-(i%q==0)]+=v;
    }
    if(l/q-(l%q==0) != r/q-(r%q==0))
    for (int i=r;i>i2*q&&i>=l;--i)
    {
        a[i]+=v;
        sum[i/q-(i%q==0)]+=v;
    }
    //for (int i=1;i<=n;++i) printf("%lld ", a[i]); printf("\n");
    //for (int i=0;i<num;++i) printf("%lld ", lazy[i]); printf("\n");
    //printf("%d %d\n", p1, p2);
}
ll query(int l, int r)
{
    ll ans = 0;
    int i1 = l/q, i2 = r/q;
    int m1 = l%q, m2 = r%q;
    int p1 = i1+(m1!=0&&m1!=1), p2 = i2-1;
    for (int i=p1;i<=p2;++i)
        ans += sum[i]+q*lazy[i];
    for (int i=l;i<=p1*q&&i<=r;++i)
        ans += a[i]+lazy[i/q-(i%q==0)];
    if(l/q-(l%q==0) != r/q-(r%q==0))
    for (int i=r;i>i2*q&&i>=l;--i)
        ans += a[i]+lazy[i/q-(i%q==0)];
    return ans;
}
int main()
{
    scanf("%d", &n);
    for (int i=1;i<=n;++i) scanf("%lld", &a[i]);
    init();
    scanf("%d", &m);
    for (int i=1;i<=m;++i)
    {
        int op, l, r, v;
        scanf("%d%d%d", &op, &l, &r);
        if(op==1)
        {
            scanf("%d", &v);
            change(l, r, v);
        }
        else{
            printf("%lld\n", query(l, r));
        }
    }
    return 0;
}