import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)

class LazySegTree(object):
    def __init__(self, N, op_data, u_data, op_lazy, u_lazy, op_merge):
        self._n = N
        self.log = (N-1).bit_length()
        self.size = 1 << self.log

        self.op = op_data
        self.composition = op_lazy
        self.mapping = op_merge
        self.e = u_data
        self.id = u_lazy

        self.data = [u_data] * (2 * self.size)
        self.lazy = [u_lazy] * self.size

    def initialize(self, arr):
        """ segtreeをarrで初期化する。len(arr) == Nにすること """
        for i, a in enumerate(arr, self.size):
            self.data[i] = a
        for i in reversed(range(1, self.size)):
            self.__update(i)

    def __update(self, i):
        self.data[i] = self.op(self.data[i << 1], self.data[i << 1 | 1])

    def __all_apply(self, i, F):
        self.data[i] = self.mapping(F, self.data[i])
        if i < self.size:
            self.lazy[i] = self.composition(F, self.lazy[i])

    def __push(self, i):
        self.__all_apply(i << 1, self.lazy[i])
        self.__all_apply(i << 1 | 1, self.lazy[i])
        self.lazy[i] = self.id

    def update(self, p, x):
        """ data[p] = x とする (0-indexed)"""
        p += self.size
        for i in reversed(range(1, self.log + 1)):
            self.__push(p >> i)
        self.data[p] = x
        for i in range(1, self.log + 1):
            self.__update(p >> i)

    def apply(self, p, F):
        """ data[p]にFを作用させる(data[p] = op_merge(F, data[p])とする, 0-indexed) """
        p += self.size
        for i in reversed(range(1, self.log + 1)):
            self.__push(p >> i)
        self.data[p] = self.mapping(F, self.data[p])
        for i in range(1, self.log + 1):
            self.__update(p >> i)

    def range_apply(self, l, r, F):
        """ i = l, l+1, ..., r-1 について、Fを作用させる(op_merge(F, data[i]), 0-indexed) """
        if l == r:
            return

        l += self.size
        r += self.size
        for i in reversed(range(1, self.log + 1)):  # too->down
            if ((l >> i) << i) != l:
                self.__push(l >> i)
            if ((r >> i) << i) != r:
                self.__push((r - 1) >> i)

        l2, r2 = l, r
        while l < r:
            if l & 1:
                self.__all_apply(l, F)
                l += 1
            if r & 1:
                r -= 1
                self.__all_apply(r, F)
            l >>= 1
            r >>= 1
        l, r = l2, r2

        for i in range(1, self.log + 1):
            if ((l >> i) << i) != l:
                self.__update(l >> i)
            if ((r >> i) << i) != r:
                self.__update((r - 1) >> i)

    def get(self, p):
        """ data[p]を返す """
        p += self.size
        for i in reversed(range(1, self.log + 1)):
            self.__push(p >> i)
        return self.data[p]

    def prod(self, l, r):
        """
        op_data(data[l], data[l+1], ..., data[r-1])を返す (0-indexed)
        l == rの時は単位元u_dataを返す
        """
        if l == r:
            return self.e

        l += self.size
        r += self.size
        for i in reversed(range(1, self.log + 1)):
            if ((l >> i) << i) != l:
                self.__push(l >> i)
            if ((r >> i) << i) != r:
                self.__push(r >> i)

        sml = self.e
        smr = self.e
        while l < r:
            if l & 1:
                sml = self.op(sml, self.data[l])
                l += 1
            if r & 1:
                r -= 1
                smr = self.op(self.data[r], smr)
            l >>= 1
            r >>= 1
        return self.op(sml, smr)

    def all_prod(self):
        """ op(data[0], data[1], ... data[N-1])を返す """
        return self.data[1]

    def max_right(self, l, func):
        """
        func(l, l+1, ..., r-1) = True,
        func(l, l+1, ..., r-1, r) = Falseとなる r を返す
        """
        if l == self._n:
            return self._n
        l += self.size
        for i in reversed(range(1, self.log + 1)):
            self.__push(l >> i)

        sm = self.e
        while True:
            while l % 2 == 0:
                l >>= 1
            if not func(self.op(sm, self.data[[l]])):
                while l < self.size:
                    self.__push(l)
                    l <<= 1
                    if func(self.op(sm, self.data[l])):
                        sm = self.op(sm, self.data[l])
                        l += 1
                return l - self.size
            sm = self.op(sm, self.data[l])
            l += 1
            if (l & -l) == l:
                break
        return self._n

    def min_left(self, r, func):
        """
        func(     l, l+1, ..., r-1) = True,
        func(l-1, l, l+1, ..., r-1) = Falseとなる l を返す
        """
        if r == 0:
            return 0
        r += self.size
        for i in reversed(range(1, self.log + 1)):
            self.__push((r - 1) >> i)
        sm = self.e
        while True:
            r -= 1
            while r > 1 and r & 1:
                r >>= 1
            if not func(self.op(self.data[r], sm)):
                while r < self.size:
                    self.__push(r)
                    r = r << 1 | 1
                    if func(self.op(self.data[r], sm)):
                        sm = self.op(self.data[r], sm)
                        r -= 1
                return r + 1 - self.size
            sm = self.op(self.data[r], sm)
            if (r & -r) == r:
                break
        return 0


u_data = (0, 0, 0)  # size, sum, sqsum
u_lazy = 0


def op_data(l, r):
    return l[0]+r[0], l[1]+r[1], l[2]+r[2]


def op_lazy(a, b):
    return a + b


def op_merge(lz, d):
    return d[0], d[1] + d[0] * lz, d[2] + (2 * d[1] + d[0] * lz) * lz


N = int(input())
A = tuple(map(int, input().split()))

seg = LazySegTree(N, op_data, u_data, op_lazy, u_lazy, op_merge)
seg.initialize([(1, a, a * a) for a in A])

Q = int(input())
for _ in range(Q):
    k, *arg = map(int, input().split())
    if k == 1:
        l, r, x = arg
        seg.range_apply(l - 1, r, x)
    else:
        l, r = arg
        print(seg.prod(l - 1, r)[2])