import sys sys.setrecursionlimit(10 ** 6) N = int(input()) A = list(map(int,input().split())) n = 1 while n < N: n <<= 1 dat = [[0] * 2 for _ in range(2 * n - 1)] lazy = [0] * (2 * n - 1) for i in range(N): j = i + n -1 dat[j][0] = A[i] dat[j][1] = A[i] ** 2 def make(): for k in reversed(range(n-1)): dat[k][0] = dat[k*2+1][0] + dat[k*2+2][0] dat[k][1] = dat[k*2+1][1] + dat[k*2+2][1] make() def eval(k,l,r): if lazy[k] == 0:return if k < n-1: lazy[k*2+1] = lazy[k] lazy[k*2+2] = lazy[k] x = lazy[k] dat[k][1] += 2 * dat[k][0] * x + x * x * (r-l) dat[k][0] += x * (r-l) lazy[k] = 0 def update(a,b,x,k=0,l=0,r=n): eval(k,l,r) if r <= a or b <= l:return if a <= l and r <= b: lazy[k] = x eval(k,l,r) return update(a,b,x,k*2+1,l,(l+r)//2) update(a,b,x,k*2+2,(l+r)//2,r) dat[k][0] =dat[k*2+1][0]+dat[k*2+2][0] dat[k][1] = dat[k*2+1][1]+dat[k*2+2][1] def query(a,b,k=0,l=0,r=n): eval(k,l,r) if r <= a or b <= l:return 0 if a <= l and r <= b: return dat[k][1] v1 = query(a,b,k*2+1,l,(l+r)//2) v2 = query(a,b,k*2+2,(l+r)//2,r) return v1+v2 Q = int(input()) for _ in range(Q): l = list(map(int,input().split())) if l[0] == 1: update(l[1]-1,l[2],l[3]) else: print(query(l[1]-1,l[2]))