n = int(input()) A = list(map(int,input().split())) segtree0 = [0]*(2*n) segtree1 = [0]*(2*n) for i in range(n): segtree1[n+i] = A[i] i = n-1 while i: segtree1[i] = segtree1[i<<1]+segtree1[i<<1|1] i -= 1 q = int(input()) res = 0 for k in range(q): x,y,l,r = map(int,input().split()) i = x+n-1 y -= segtree1[i] while i: res += segtree0[i]*y segtree1[i] += y i>>=1 l += n-1 r += n while l < r: if l&1: segtree0[l] += 1 res += segtree1[l] l += 1 if r&1: r -= 1 segtree0[r] += 1 res += segtree1[r] l>>=1 r>>=1 print(res)