#include <cmath>

#include <cstdio>

#include <cstring>

#include <iostream>

#include <algorithm>

using namespace std;

#define maxn 200005

#define ll long long

ll n,m,flag[maxn],size,bel[maxn],dis[maxn];

ll sum[maxn],li[maxn],ri[maxn],blo,si[maxn];

inline void in(ll &now)

{

    ll if_z=;now=;

    char Cget=getchar();

    while(Cget>''||Cget<'')

    {

        if(Cget=='-') if_z=-;

        Cget=getchar();

    }

    while(Cget>=''&&Cget<='')

    {

        now=now*+Cget-'';

        Cget=getchar();

    }

    now*=if_z;

}

int main()

{

    in(n),size=sqrt(n);ll pos=,x;

    for(ll i=;i<=n;i++)

    {

        in(dis[i]);

        if(pos==) li[++blo]=i;

        pos++,sum[blo]+=dis[i],bel[i]=blo;

        if(pos==size) pos=,ri[blo]=i;

    }

    ri[blo]=n;

    for(ll i=;i<=blo;i++) si[i]=ri[i]-li[i]+;

    ll ty,l,r;in(m);

    while(m--)

    {

        in(ty),in(l),in(r);

        if(ty==)

        {

            in(x);

            for(ll i=bel[l];i<=bel[r];i++)

            {

                if(l<=li[i]&&r>=ri[i]) flag[i]+=x,sum[i]+=si[i]*x;

                else

                {

                    for(ll j=max(l,li[i]);j<=min(r,ri[i]);j++) dis[j]+=x,sum[i]+=x;

                }

            }

        }

        else

        {

            ll ans=;

            for(ll i=bel[l];i<=bel[r];i++)

            {

                if(l<=li[i]&&r>=ri[i]) ans+=sum[i];

                else for(ll j=max(li[i],l);j<=min(ri[i],r);j++) ans+=dis[j]+flag[i];

            }

            printf("%lld\n",ans);

        }

    }

    return ;

}