import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

n=II()
aa=LI()

# 遅延セグツリーの準備...sq2乗和、sm和、lz遅延
wd=1<<(n-1).bit_length()
sq=[0]*2*wd
sm=[0]*2*wd
lz=[0]*2*wd
for i,a in enumerate(aa):sq[wd+i]=a**2
sm[wd:wd+n]=aa
for u in range(wd-1,0,-1):
    sq[u]=sq[u*2]+sq[u*2+1]
    sm[u]=sm[u*2]+sm[u*2+1]

def _eval(u,tl,tr):
    if lz[u]==0:return 
    sq[u]+=lz[u]**2*(tr-tl)+2*sm[u]*lz[u]
    sm[u]+=lz[u]*(tr-tl)
    if u<wd:
        lz[u*2]+=lz[u]
        lz[u*2+1]+=lz[u]
    lz[u]=0

def add(l,r,d,u=1,tl=0,tr=-1):
    if tr==-1:tr=wd
    if r<=tl or tr<=l:
        _eval(u,tl,tr)
        return
    if l<=tl and tr<=r:
        lz[u]+=d
        _eval(u,tl,tr)
        return
    _eval(u, tl, tr)
    tm=(tl+tr)//2
    add(l,r,d,u*2,tl,tm)
    add(l,r,d,u*2+1,tm,tr)
    sq[u]=sq[u*2]+sq[u*2+1]
    sm[u]=sm[u*2]+sm[u*2+1]

def sqsum(l,r,u=1,tl=0,tr=-1):
    if tr==-1:tr=wd
    if r<=tl or tr<=l:return 0
    _eval(u,tl,tr)
    if l<=tl and tr<=r:return sq[u]
    tm=(tl+tr)//2
    return sqsum(l,r,u*2,tl,tm)+sqsum(l,r,u*2+1,tm,tr)

for _ in range(II()):
    """
    print(sq)
    print(sm)
    print(lz)
    print()
    """
    q=LI()
    if q[0]==1:
        _,l,r,d=q
        add(l-1,r,d)
    else:
        _,l,r=q
        print(sqsum(l-1,r))